Base | Representation |
---|---|
bin | 10001111001110100110… |
… | …111000010000100100000 |
3 | 11100121200012110012020010 |
4 | 101321310313002010200 |
5 | 130124144213330422 |
6 | 2341111325444520 |
7 | 154613335622562 |
oct | 21716467020440 |
9 | 4317605405203 |
10 | 1230321230112 |
11 | 43485a295057 |
12 | 17a540110740 |
13 | 8c0323a1ba0 |
14 | 437954b1332 |
15 | 2200bb18b0c |
hex | 11e74dc2120 |
1230321230112 has 48 divisors (see below), whose sum is σ = 3478023480960. Its totient is φ = 378560378112.
The previous prime is 1230321230077. The next prime is 1230321230123. The reversal of 1230321230112 is 2110321230321.
It is a tau number, because it is divible by the number of its divisors (48).
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 7 ways as a sum of consecutive naturals, for example, 492915912 + ... + 492918407.
It is an arithmetic number, because the mean of its divisors is an integer number (72458822520).
Almost surely, 21230321230112 is an apocalyptic number.
1230321230112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1230321230112 is an abundant number, since it is smaller than the sum of its proper divisors (2247702250848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1230321230112 is a wasteful number, since it uses less digits than its factorization.
1230321230112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 985834345 (or 985834337 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1230321230112 its reverse (2110321230321), we get a palindrome (3340642460433).
The spelling of 1230321230112 in words is "one trillion, two hundred thirty billion, three hundred twenty-one million, two hundred thirty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •