Base | Representation |
---|---|
bin | 10111010000110100101010… |
… | …100100111111111100110101 |
3 | 111102020211220120201020112010 |
4 | 113100310222210333330311 |
5 | 101402231143324101323 |
6 | 1001333030121514433 |
7 | 30356510120436552 |
oct | 2720645244777465 |
9 | 442224816636463 |
10 | 102311130300213 |
11 | 2a6659a789957a |
12 | b5846ba642a19 |
13 | 4511b8a425873 |
14 | 1b39c56b11a29 |
15 | bc6532187c93 |
hex | 5d0d2a93ff35 |
102311130300213 has 16 divisors (see below), whose sum is σ = 139410974269440. Its totient is φ = 66711305150256.
The previous prime is 102311130300163. The next prime is 102311130300227. The reversal of 102311130300213 is 312003031113201.
It is a happy number.
It is not a de Polignac number, because 102311130300213 - 26 = 102311130300149 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102311130300213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102311130300013) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 243775153 + ... + 244194486.
It is an arithmetic number, because the mean of its divisors is an integer number (8713185891840).
Almost surely, 2102311130300213 is an apocalyptic number.
It is an amenable number.
102311130300213 is a deficient number, since it is larger than the sum of its proper divisors (37099843969227).
102311130300213 is a wasteful number, since it uses less digits than its factorization.
102311130300213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 487971176.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 102311130300213 its reverse (312003031113201), we get a palindrome (414314161413414).
The spelling of 102311130300213 in words is "one hundred two trillion, three hundred eleven billion, one hundred thirty million, three hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •