Base | Representation |
---|---|
bin | 10111010000111111110101… |
… | …010110100110001100000000 |
3 | 111102021222212022122121021002 |
4 | 113100333311112212030000 |
5 | 101402430223242442422 |
6 | 1001342332102351132 |
7 | 30360413233260143 |
oct | 2720776526461400 |
9 | 442258768577232 |
10 | 102323122234112 |
11 | 2a66aaa0a40a4a |
12 | b586aa672b4a8 |
13 | 451304b9c4b40 |
14 | 1b3a67363005a |
15 | bc69d4d63692 |
hex | 5d0ff55a6300 |
102323122234112 has 36 divisors (see below), whose sum is σ = 219957817453920. Its totient is φ = 47226056414208.
The previous prime is 102323122234111. The next prime is 102323122234127. The reversal of 102323122234112 is 211432221323201.
It is not an unprimeable number, because it can be changed into a prime (102323122234111) 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 3 ways as a sum of consecutive naturals, for example, 15373061912 + ... + 15373068567.
It is an arithmetic number, because the mean of its divisors is an integer number (6109939373720).
Almost surely, 2102323122234112 is an apocalyptic number.
It is an amenable number.
102323122234112 is an abundant number, since it is smaller than the sum of its proper divisors (117634695219808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102323122234112 is an equidigital number, since it uses as much as digits as its factorization.
102323122234112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30746130508 (or 30746130494 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 102323122234112 its reverse (211432221323201), we get a palindrome (313755343557313).
The spelling of 102323122234112 in words is "one hundred two trillion, three hundred twenty-three billion, one hundred twenty-two million, two hundred thirty-four thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •