Base | Representation |
---|---|
bin | 1010111010100011111101… |
… | …0101011100001101100100 |
3 | 1120111022012100100220102120 |
4 | 2232220333111130031210 |
5 | 3033111430002211322 |
6 | 41305135320105540 |
7 | 2346025645101054 |
oct | 256507725341544 |
9 | 46438170326376 |
10 | 12001201210212 |
11 | 3907754237915 |
12 | 1419ab60052b0 |
13 | 690929518b66 |
14 | 2d6c0b345564 |
15 | 15c2a35e9a5c |
hex | aea3f55c364 |
12001201210212 has 48 divisors (see below), whose sum is σ = 28275505370112. Its totient is φ = 3961445179680.
The previous prime is 12001201210211. The next prime is 12001201210223. The reversal of 12001201210212 is 21201210210021.
It is a junction number, because it is equal to n+sod(n) for n = 12001201210191 and 12001201210200.
It is not an unprimeable number, because it can be changed into a prime (12001201210211) 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, 48712723 + ... + 48958469.
It is an arithmetic number, because the mean of its divisors is an integer number (589073028544).
Almost surely, 212001201210212 is an apocalyptic number.
12001201210212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12001201210212 is an abundant number, since it is smaller than the sum of its proper divisors (16274304159900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12001201210212 is a wasteful number, since it uses less digits than its factorization.
12001201210212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 285368 (or 285366 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 12001201210212 its reverse (21201210210021), we get a palindrome (33202411420233).
The spelling of 12001201210212 in words is "twelve trillion, one billion, two hundred one million, two hundred ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •