Base | Representation |
---|---|
bin | 10111010001000000000000… |
… | …000100110001110000101100 |
3 | 111102022000022212010100202012 |
4 | 113101000000010301300230 |
5 | 101402431110320043200 |
6 | 1001342402010020352 |
7 | 30360420546230303 |
oct | 2721000004616054 |
9 | 442260285110665 |
10 | 102323302112300 |
11 | 2a670083530105 |
12 | b586b36a176b8 |
13 | 451307a055439 |
14 | 1b3a68d49543a |
15 | bc69e5a45a35 |
hex | 5d1000131c2c |
102323302112300 has 36 divisors (see below), whose sum is σ = 222043662941856. Its totient is φ = 40928934235200.
The previous prime is 102323302112231. The next prime is 102323302112303. The reversal of 102323302112300 is 3211203323201.
It is a super-2 number, since 2×1023233021123002 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (102323302112303) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5926205 + ... + 15484395.
Almost surely, 2102323302112300 is an apocalyptic number.
102323302112300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102323302112300 is an abundant number, since it is smaller than the sum of its proper divisors (119720360829556).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102323302112300 is a wasteful number, since it uses less digits than its factorization.
102323302112300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9665258 (or 9665251 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 102323302112300 its reverse (3211203323201), we get a palindrome (105534505435501).
The spelling of 102323302112300 in words is "one hundred two trillion, three hundred twenty-three billion, three hundred two million, one hundred twelve thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •