Base | Representation |
---|---|
bin | 1011000000010100000011… |
… | …0110111101011100101001 |
3 | 1120211202020120110102112212 |
4 | 2300011000312331130221 |
5 | 3041221310310201441 |
6 | 41422400205214505 |
7 | 2356124360455331 |
oct | 260050066753451 |
9 | 46752216412485 |
10 | 12100011022121 |
11 | 3945649858aa0 |
12 | 1435091261435 |
13 | 69a04558b199 |
14 | 2db9022ac0c1 |
15 | 15eb380d5eeb |
hex | b0140dbd729 |
12100011022121 has 16 divisors (see below), whose sum is σ = 13449310580160. Its totient is φ = 10792268685120.
The previous prime is 12100011022109. The next prime is 12100011022123. The reversal of 12100011022121 is 12122011000121.
It is not a de Polignac number, because 12100011022121 - 210 = 12100011021097 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12100011022096 and 12100011022105.
It is not an unprimeable number, because it can be changed into a prime (12100011022123) 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, 39522410 + ... + 39827388.
It is an arithmetic number, because the mean of its divisors is an integer number (840581911260).
Almost surely, 212100011022121 is an apocalyptic number.
12100011022121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12100011022121 is a deficient number, since it is larger than the sum of its proper divisors (1349299558039).
12100011022121 is a wasteful number, since it uses less digits than its factorization.
12100011022121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 373096.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 12100011022121 its reverse (12122011000121), we get a palindrome (24222022022242).
The spelling of 12100011022121 in words is "twelve trillion, one hundred billion, eleven million, twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •