Base | Representation |
---|---|
bin | 111001010111101010… |
… | …1011100110011000000 |
3 | 102210000001220001000000 |
4 | 1302233111130303000 |
5 | 4004303341020224 |
6 | 132333031000000 |
7 | 11621012561532 |
oct | 1625725346300 |
9 | 383001801000 |
10 | 123200720064 |
11 | 4828165a514 |
12 | 1ba63809000 |
13 | b805348876 |
14 | 5d6a47b852 |
15 | 3310e970c9 |
hex | 1caf55ccc0 |
123200720064 has 196 divisors, whose sum is σ = 373470440256. Its totient is φ = 40291250688.
The previous prime is 123200720063. The next prime is 123200720089. The reversal of 123200720064 is 460027002321.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (123200720063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 2447857 + ... + 2497679.
Almost surely, 2123200720064 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 123200720064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (186735220128).
123200720064 is an abundant number, since it is smaller than the sum of its proper divisors (250269720192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123200720064 is an frugal number, since it uses more digits than its factorization.
123200720064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49906 (or 49881 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 27.
Adding to 123200720064 its reverse (460027002321), we get a palindrome (583227722385).
The spelling of 123200720064 in words is "one hundred twenty-three billion, two hundred million, seven hundred twenty thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •