Base | Representation |
---|---|
bin | 10111010000110101000010… |
… | …011010001111011000010011 |
3 | 111102020212221110001212000021 |
4 | 113100311002122033120103 |
5 | 101402233003203224021 |
6 | 1001333133523404311 |
7 | 30356523044114053 |
oct | 2720650232173023 |
9 | 442225843055007 |
10 | 102311530133011 |
11 | 2a66609255a901 |
12 | b5847b0523697 |
13 | 4511c22209014 |
14 | 1b39c93c71563 |
15 | bc6557316c41 |
hex | 5d0d4268f613 |
102311530133011 has 4 divisors (see below), whose sum is σ = 102311888560792. Its totient is φ = 102311171705232.
The previous prime is 102311530133009. The next prime is 102311530133069. The reversal of 102311530133011 is 110331035113201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 102311530133011 - 21 = 102311530133009 is a prime.
It is a super-2 number, since 2×1023115301330112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102311530133611) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 178785381 + ... + 179356726.
It is an arithmetic number, because the mean of its divisors is an integer number (25577972140198).
Almost surely, 2102311530133011 is an apocalyptic number.
102311530133011 is a deficient number, since it is larger than the sum of its proper divisors (358427781).
102311530133011 is an equidigital number, since it uses as much as digits as its factorization.
102311530133011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 358427780.
The product of its (nonzero) digits is 810, while the sum is 25.
Adding to 102311530133011 its reverse (110331035113201), we get a palindrome (212642565246212).
The spelling of 102311530133011 in words is "one hundred two trillion, three hundred eleven billion, five hundred thirty million, one hundred thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •