Base | Representation |
---|---|
bin | 11101011101001011111… |
… | …11001010001101111001 |
3 | 10120202102010200102022220 |
4 | 32232211333022031321 |
5 | 113040241120041441 |
6 | 2052541524434253 |
7 | 133056556002522 |
oct | 16564577121571 |
9 | 3522363612286 |
10 | 1012102112121 |
11 | 360259290951 |
12 | 14419ab48989 |
13 | 74596633329 |
14 | 36db3845849 |
15 | 1b4d8e57466 |
hex | eba5fca379 |
1012102112121 has 16 divisors (see below), whose sum is σ = 1363446403200. Its totient is φ = 667746943488.
The previous prime is 1012102112093. The next prime is 1012102112149. The reversal of 1012102112121 is 1212112012101.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1012102112093) and next prime (1012102112149).
It is not a de Polignac number, because 1012102112121 - 25 = 1012102112089 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1012102112121.
It is not an unprimeable number, because it can be changed into a prime (1012102112191) 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, 7119940 + ... + 7260698.
It is an arithmetic number, because the mean of its divisors is an integer number (85215400200).
Almost surely, 21012102112121 is an apocalyptic number.
It is an amenable number.
1012102112121 is a deficient number, since it is larger than the sum of its proper divisors (351344291079).
1012102112121 is a wasteful number, since it uses less digits than its factorization.
1012102112121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165568.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 1012102112121 its reverse (1212112012101), we get a palindrome (2224214124222).
The spelling of 1012102112121 in words is "one trillion, twelve billion, one hundred two million, one hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •