Base | Representation |
---|---|
bin | 101111100011001101… |
… | …1000011110111100111 |
3 | 100202120110001120021000 |
4 | 1133012123003313213 |
5 | 3133111441332221 |
6 | 114524332524343 |
7 | 10243314064551 |
oct | 1370633036747 |
9 | 322513046230 |
10 | 102113230311 |
11 | 3a340290334 |
12 | 179596206b3 |
13 | 9824580591 |
14 | 4d299924d1 |
15 | 29c9a16e26 |
hex | 17c66c3de7 |
102113230311 has 16 divisors (see below), whose sum is σ = 151301196000. Its totient is φ = 68065435584.
The previous prime is 102113230309. The next prime is 102113230321. The reversal of 102113230311 is 113032311201.
102113230311 is a `hidden beast` number, since 10 + 2 + 113 + 230 + 311 = 666.
It is not a de Polignac number, because 102113230311 - 21 = 102113230309 is a prime.
It is a super-2 number, since 2×1021132303112 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102113230321) 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 15 ways as a sum of consecutive naturals, for example, 90636 + ... + 460913.
It is an arithmetic number, because the mean of its divisors is an integer number (9456324750).
Almost surely, 2102113230311 is an apocalyptic number.
102113230311 is a deficient number, since it is larger than the sum of its proper divisors (49187965689).
102113230311 is an equidigital number, since it uses as much as digits as its factorization.
102113230311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 558415 (or 558409 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 102113230311 its reverse (113032311201), we get a palindrome (215145541512).
The spelling of 102113230311 in words is "one hundred two billion, one hundred thirteen million, two hundred thirty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •