Base | Representation |
---|---|
bin | 1011000001100010111111… |
… | …1000011000110011011010 |
3 | 1120220202221100011212011122 |
4 | 2300120233320120303122 |
5 | 3042043204430120442 |
6 | 41440223004325242 |
7 | 2360504442462215 |
oct | 260305770306332 |
9 | 46822840155148 |
10 | 12121201020122 |
11 | 3953632a82137 |
12 | 1439205843822 |
13 | 69c04166783c |
14 | 2dc95263c77c |
15 | 160478563dd2 |
hex | b062fe18cda |
12121201020122 has 8 divisors (see below), whose sum is σ = 18320593908672. Its totient is φ = 6014336383900.
The previous prime is 12121201020107. The next prime is 12121201020157. The reversal of 12121201020122 is 22102010212121.
12121201020122 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 super-2 number, since 2×121212010201222 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12121201020122.
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, 23132062754 + ... + 23132063277.
It is an arithmetic number, because the mean of its divisors is an integer number (2290074238584).
Almost surely, 212121201020122 is an apocalyptic number.
12121201020122 is a deficient number, since it is larger than the sum of its proper divisors (6199392888550).
12121201020122 is a wasteful number, since it uses less digits than its factorization.
12121201020122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46264126164.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 12121201020122 its reverse (22102010212121), we get a palindrome (34223211232243).
The spelling of 12121201020122 in words is "twelve trillion, one hundred twenty-one billion, two hundred one million, twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •