Base | Representation |
---|---|
bin | 111001010101101001… |
… | …1111010111011010000 |
3 | 102202211100212012001010 |
4 | 1302223103322323100 |
5 | 4004134100212240 |
6 | 132322220010520 |
7 | 11616233006241 |
oct | 1625323727320 |
9 | 382740765033 |
10 | 123133210320 |
11 | 4824753a43a |
12 | 1ba45090a40 |
13 | b7c436c683 |
14 | 5d61506cc8 |
15 | 330a0ae280 |
hex | 1cab4faed0 |
123133210320 has 320 divisors, whose sum is σ = 423158630400. Its totient is φ = 29479127040.
The previous prime is 123133210223. The next prime is 123133210337. The reversal of 123133210320 is 23012331321.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 11426535 + ... + 11437305.
It is an arithmetic number, because the mean of its divisors is an integer number (1322370720).
Almost surely, 2123133210320 is an apocalyptic number.
123133210320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 123133210320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (211579315200).
123133210320 is an abundant number, since it is smaller than the sum of its proper divisors (300025420080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123133210320 is a wasteful number, since it uses less digits than its factorization.
123133210320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10938 (or 10932 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 123133210320 its reverse (23012331321), we get a palindrome (146145541641).
The spelling of 123133210320 in words is "one hundred twenty-three billion, one hundred thirty-three million, two hundred ten thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •