Base | Representation |
---|---|
bin | 1010111011101110100010… |
… | …0011001000111111110010 |
3 | 1120120012212111021211010220 |
4 | 2232323220203020333302 |
5 | 3033423424311121320 |
6 | 41322250000433510 |
7 | 2350335016136442 |
oct | 256735043107762 |
9 | 46505774254126 |
10 | 12021220020210 |
11 | 3915197344095 |
12 | 1421962318896 |
13 | 692799a7b36b |
14 | 2d7b89d26122 |
15 | 15ca75d2de40 |
hex | aeee88c8ff2 |
12021220020210 has 32 divisors (see below), whose sum is σ = 28852528534272. Its totient is φ = 3205480840320.
The previous prime is 12021220020181. The next prime is 12021220020211. The reversal of 12021220020210 is 1202002212021.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 12021220020210.
It is not an unprimeable number, because it can be changed into a prime (12021220020211) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10564234 + ... + 11646693.
It is an arithmetic number, because the mean of its divisors is an integer number (901641516696).
Almost surely, 212021220020210 is an apocalyptic number.
12021220020210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12021220020210 is an abundant number, since it is smaller than the sum of its proper divisors (16831308514062).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12021220020210 is a wasteful number, since it uses less digits than its factorization.
12021220020210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22228978.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 12021220020210 its reverse (1202002212021), we get a palindrome (13223222232231).
The spelling of 12021220020210 in words is "twelve trillion, twenty-one billion, two hundred twenty million, twenty thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •