Base | Representation |
---|---|
bin | 110100010110000000111001… |
… | …011101000111110101110000 |
3 | 1010012002222101010002101000121 |
4 | 310112000321131013311300 |
5 | 220133240030004014300 |
6 | 2133341323105300024 |
7 | 66330132262630522 |
oct | 6426007135076560 |
9 | 1105088333071017 |
10 | 230211211001200 |
11 | 6739703201a750 |
12 | 219a0584934614 |
13 | 9b5ba93581400 |
14 | 40bc3d3da9a12 |
15 | 1b934c665a81a |
hex | d16039747d70 |
230211211001200 has 180 divisors, whose sum is σ = 653345363062008. Its totient is φ = 77273692953600.
The previous prime is 230211211001179. The next prime is 230211211001311. The reversal of 230211211001200 is 2100112112032.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 154051459 + ... + 155538658.
Almost surely, 2230211211001200 is an apocalyptic number.
230211211001200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
230211211001200 is an abundant number, since it is smaller than the sum of its proper divisors (423134152060808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230211211001200 is a wasteful number, since it uses less digits than its factorization.
230211211001200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 309590172 (or 309590148 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 230211211001200 its reverse (2100112112032), we get a palindrome (232311323113232).
The spelling of 230211211001200 in words is "two hundred thirty trillion, two hundred eleven billion, two hundred eleven million, one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •