Base | Representation |
---|---|
bin | 110100010010111101010100… |
… | …011011010011100000000000 |
3 | 1010011100220022210100212122111 |
4 | 310102331110123103200000 |
5 | 220121314434242041000 |
6 | 2133101033001345104 |
7 | 66306016253546245 |
oct | 6422752433234000 |
9 | 1104326283325574 |
10 | 230001210112000 |
11 | 67315a68a97468 |
12 | 21967937a98194 |
13 | 9b45037323122 |
14 | 40b21919b35cc |
15 | 1b8ccd51eecba |
hex | d12f546d3800 |
230001210112000 has 384 divisors, whose sum is σ = 610379989128000. Its totient is φ = 86259636633600.
The previous prime is 230001210111997. The next prime is 230001210112033. The reversal of 230001210112000 is 211012100032.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 471564256 + ... + 472051744.
Almost surely, 2230001210112000 is an apocalyptic number.
230001210112000 is a gapful number since it is divisible by the number (20) 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 230001210112000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (305189994564000).
230001210112000 is an abundant number, since it is smaller than the sum of its proper divisors (380378779016000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230001210112000 is an equidigital number, since it uses as much as digits as its factorization.
230001210112000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 487642 (or 487612 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 230001210112000 its reverse (211012100032), we get a palindrome (230212222212032).
The spelling of 230001210112000 in words is "two hundred thirty trillion, one billion, two hundred ten million, one hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •