Base | Representation |
---|---|
bin | 1011000110001101000001… |
… | …0000110110101111111010 |
3 | 1121012102102200122002002021 |
4 | 2301203100100312233322 |
5 | 3044401030001400442 |
6 | 41541053210025054 |
7 | 2366336066003464 |
oct | 261432020665772 |
9 | 47172380562067 |
10 | 12201201200122 |
11 | 3984555aa1480 |
12 | 145081171818a |
13 | 6a675083355c |
14 | 302781423134 |
15 | 1625aba6ae67 |
hex | b18d0436bfa |
12201201200122 has 8 divisors (see below), whose sum is σ = 19965601963872. Its totient is φ = 5546000545500.
The previous prime is 12201201200087. The next prime is 12201201200131. The reversal of 12201201200122 is 22100210210221.
It is a happy number.
12201201200122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 12201201200096 and 12201201200105.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 277300027254 + ... + 277300027297.
It is an arithmetic number, because the mean of its divisors is an integer number (2495700245484).
Almost surely, 212201201200122 is an apocalyptic number.
12201201200122 is a deficient number, since it is larger than the sum of its proper divisors (7764400763750).
12201201200122 is a wasteful number, since it uses less digits than its factorization.
12201201200122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 554600054564.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 12201201200122 its reverse (22100210210221), we get a palindrome (34301411410343).
It can be divided in two parts, 1220120 and 1200122, that added together give a palindrome (2420242).
The spelling of 12201201200122 in words is "twelve trillion, two hundred one billion, two hundred one million, two hundred thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •