Base | Representation |
---|---|
bin | 111001010111101001… |
… | …0101101000000000000 |
3 | 102210000000112110020222 |
4 | 1302233102231000000 |
5 | 4004303200000000 |
6 | 132333003322212 |
7 | 11621003502320 |
oct | 1625722550000 |
9 | 383000473228 |
10 | 123200000000 |
11 | 48281208520 |
12 | 1ba63520368 |
13 | b805155bac |
14 | 5d6a331280 |
15 | 3310da3a85 |
hex | 1caf4ad000 |
123200000000 has 468 divisors, whose sum is σ = 383952928416. Its totient is φ = 38400000000.
The previous prime is 123199999943. The next prime is 123200000003. The reversal of 123200000000 is 2321.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123200000003) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 11199999995 + ... + 11200000005.
Almost surely, 2123200000000 is an apocalyptic number.
123200000000 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 123200000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (191976464208).
123200000000 is an abundant number, since it is smaller than the sum of its proper divisors (260752928416).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123200000000 is an frugal number, since it uses more digits than its factorization.
123200000000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82 (or 25 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 8.
Adding to 123200000000 its reverse (2321), we get a palindrome (123200002321).
The spelling of 123200000000 in words is "one hundred twenty-three billion, two hundred million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •