Base | Representation |
---|---|
bin | 1011001100101001110110… |
… | …1001101001100010111000 |
3 | 1121121000110221000221100110 |
4 | 2303022131221221202320 |
5 | 3103210004412230240 |
6 | 42104021531304320 |
7 | 2410341235364235 |
oct | 263123551514270 |
9 | 47530427027313 |
10 | 12312021211320 |
11 | 3a17554000096 |
12 | 146a19abab0a0 |
13 | 6b4031b9b88c |
14 | 307c954a078c |
15 | 1653e5b3ec80 |
hex | b329da698b8 |
12312021211320 has 64 divisors (see below), whose sum is σ = 36936330066720. Its totient is φ = 3283181973504.
The previous prime is 12312021211181. The next prime is 12312021211337. The reversal of 12312021211320 is 2311212021321.
12312021211320 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×123120212113202 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21892692 + ... + 22448028.
Almost surely, 212312021211320 is an apocalyptic number.
12312021211320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12312021211320 is an abundant number, since it is smaller than the sum of its proper divisors (24624308855400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12312021211320 is a wasteful number, since it uses less digits than its factorization.
12312021211320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 740104 (or 740100 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 12312021211320 its reverse (2311212021321), we get a palindrome (14623233232641).
The spelling of 12312021211320 in words is "twelve trillion, three hundred twelve billion, twenty-one million, two hundred eleven thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •