Base | Representation |
---|---|
bin | 1010111011110001111001… |
… | …0011111110001001110100 |
3 | 1120120022012100112211001101 |
4 | 2232330132103332021310 |
5 | 3033432301213411200 |
6 | 41322515301335444 |
7 | 2350366251016060 |
oct | 256743623761164 |
9 | 46508170484041 |
10 | 12022122013300 |
11 | 391560a507923 |
12 | 1421b74407584 |
13 | 6928b18c1c99 |
14 | 2d7c33a40aa0 |
15 | 15caca10126a |
hex | aef1e4fe274 |
12022122013300 has 72 divisors (see below), whose sum is σ = 31111161008256. Its totient is φ = 3942658642560.
The previous prime is 12022122013273. The next prime is 12022122013327. The reversal of 12022122013300 is 331022122021.
It is an interprime number because it is at equal distance from previous prime (12022122013273) and next prime (12022122013327).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 373341727 + ... + 373373926.
It is an arithmetic number, because the mean of its divisors is an integer number (432099458448).
Almost surely, 212022122013300 is an apocalyptic number.
12022122013300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12022122013300 is an abundant number, since it is smaller than the sum of its proper divisors (19089038994956).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12022122013300 is a wasteful number, since it uses less digits than its factorization.
12022122013300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 746715697 (or 746715690 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 12022122013300 its reverse (331022122021), we get a palindrome (12353144135321).
The spelling of 12022122013300 in words is "twelve trillion, twenty-two billion, one hundred twenty-two million, thirteen thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •