Base | Representation |
---|---|
bin | 10111001101110001000011… |
… | …111011000010100100100011 |
3 | 111101111202210100121202120211 |
4 | 113031301003323002210203 |
5 | 101340311024120023021 |
6 | 1001052333200514551 |
7 | 30335363330333413 |
oct | 2715610373024443 |
9 | 441452710552524 |
10 | 102101102111011 |
11 | 2a59491a40a403 |
12 | b54ba6461ba57 |
13 | 44c8128629533 |
14 | 1b2da10c50643 |
15 | bc0d3d6383e1 |
hex | 5cdc43ec2923 |
102101102111011 has 32 divisors (see below), whose sum is σ = 111494416550400. Its totient is φ = 93185246119680.
The previous prime is 102101102110993. The next prime is 102101102111027. The reversal of 102101102111011 is 110111201101201.
It is a cyclic number.
It is not a de Polignac number, because 102101102111011 - 27 = 102101102110883 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102101102110982 and 102101102111000.
It is not an unprimeable number, because it can be changed into a prime (102101102111081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 18549895 + ... + 23415823.
It is an arithmetic number, because the mean of its divisors is an integer number (3484200517200).
Almost surely, 2102101102111011 is an apocalyptic number.
102101102111011 is a deficient number, since it is larger than the sum of its proper divisors (9393314439389).
102101102111011 is a wasteful number, since it uses less digits than its factorization.
102101102111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4866379.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 102101102111011 its reverse (110111201101201), we get a palindrome (212212303212212).
The spelling of 102101102111011 in words is "one hundred two trillion, one hundred one billion, one hundred two million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •