Base | Representation |
---|---|
bin | 11011100010100001110010… |
… | …101100110111101000001010 |
3 | 120212211221220012100101001112 |
4 | 123202201302230313220022 |
5 | 111333412231020041020 |
6 | 1105333432201050322 |
7 | 34340426364103106 |
oct | 3342416254675012 |
9 | 525757805311045 |
10 | 121120002112010 |
11 | 35657782666a90 |
12 | 11701a4b7869a2 |
13 | 527774b16bc85 |
14 | 21ca34cc0c906 |
15 | e0092113d2c5 |
hex | 6e2872b37a0a |
121120002112010 has 64 divisors (see below), whose sum is σ = 240011853058944. Its totient is φ = 43640867020800.
The previous prime is 121120002111989. The next prime is 121120002112019. The reversal of 121120002112010 is 10211200021121.
It is a super-2 number, since 2×1211200021120102 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (121120002112019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 40327637 + ... + 43226823.
It is an arithmetic number, because the mean of its divisors is an integer number (3750185204046).
Almost surely, 2121120002112010 is an apocalyptic number.
121120002112010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121120002112010 is a deficient number, since it is larger than the sum of its proper divisors (118891850946934).
121120002112010 is a wasteful number, since it uses less digits than its factorization.
121120002112010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2902679.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 121120002112010 its reverse (10211200021121), we get a palindrome (131331202133131).
The spelling of 121120002112010 in words is "one hundred twenty-one trillion, one hundred twenty billion, two million, one hundred twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •