Base | Representation |
---|---|
bin | 111001010100101100… |
… | …1111000110010100000 |
3 | 102202202010122220120110 |
4 | 1302221121320302200 |
5 | 4004102403020000 |
6 | 132315114211320 |
7 | 11615364051063 |
oct | 1625131706240 |
9 | 382663586513 |
10 | 123101220000 |
11 | 4823047a660 |
12 | 1ba36423b40 |
13 | b7ba84b7a5 |
14 | 5d5b17a8da |
15 | 3307390850 |
hex | 1ca9678ca0 |
123101220000 has 720 divisors, whose sum is σ = 458872688736. Its totient is φ = 28627200000.
The previous prime is 123101219999. The next prime is 123101220013. The reversal of 123101220000 is 22101321.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 1733819965 + ... + 1733820035.
Almost surely, 2123101220000 is an apocalyptic number.
123101220000 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 123101220000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (229436344368).
123101220000 is an abundant number, since it is smaller than the sum of its proper divisors (335771468736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123101220000 is an equidigital number, since it uses as much as digits as its factorization.
123101220000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 223 (or 129 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 123101220000 its reverse (22101321), we get a palindrome (123123321321).
The spelling of 123101220000 in words is "one hundred twenty-three billion, one hundred one million, two hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •