Base | Representation |
---|---|
bin | 11011111110010101101111… |
… | …101000010011111010001000 |
3 | 121010121200001122010000122010 |
4 | 123332111233220103322020 |
5 | 112111220410011012300 |
6 | 1113355431425055520 |
7 | 34625466046634232 |
oct | 3376255750237210 |
9 | 533550048100563 |
10 | 123031211032200 |
11 | 36224275235379 |
12 | 119703337875a0 |
13 | 5385a411a9763 |
14 | 2254a57173252 |
15 | e354cde8ca50 |
hex | 6fe56fa13e88 |
123031211032200 has 96 divisors (see below), whose sum is σ = 386768539604160. Its totient is φ = 32346233875200.
The previous prime is 123031211032183. The next prime is 123031211032201. The reversal of 123031211032200 is 2230112130321.
It is not an unprimeable number, because it can be changed into a prime (123031211032201) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1443985699 + ... + 1444070898.
It is an arithmetic number, because the mean of its divisors is an integer number (4028838954210).
Almost surely, 2123031211032200 is an apocalyptic number.
123031211032200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
123031211032200 is an abundant number, since it is smaller than the sum of its proper divisors (263737328571960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123031211032200 is a wasteful number, since it uses less digits than its factorization.
123031211032200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2888056687 (or 2888056678 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 123031211032200 its reverse (2230112130321), we get a palindrome (125261323162521).
The spelling of 123031211032200 in words is "one hundred twenty-three trillion, thirty-one billion, two hundred eleven million, thirty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •