Base | Representation |
---|---|
bin | 11110110111011011100… |
… | …110101001110100111111 |
3 | 21111202221022220211211200 |
4 | 132313123212221310333 |
5 | 234223004411020111 |
6 | 4302231003150543 |
7 | 306146625614265 |
oct | 36673346516477 |
9 | 7452838824750 |
10 | 2121103220031 |
11 | 74861151a4a4 |
12 | 2a3101215453 |
13 | 125033188c53 |
14 | 7493a532435 |
15 | 3a294c53256 |
hex | 1eddb9a9d3f |
2121103220031 has 12 divisors (see below), whose sum is σ = 3064473717552. Its totient is φ = 1413765141696.
The previous prime is 2121103220029. The next prime is 2121103220057. The reversal of 2121103220031 is 1300223011212.
It is not a de Polignac number, because 2121103220031 - 21 = 2121103220029 is a prime.
It is a super-2 number, since 2×21211032200312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2121103219986 and 2121103220013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2121103230031) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 25261731 + ... + 25345556.
It is an arithmetic number, because the mean of its divisors is an integer number (255372809796).
Almost surely, 22121103220031 is an apocalyptic number.
2121103220031 is a deficient number, since it is larger than the sum of its proper divisors (943370497521).
2121103220031 is a wasteful number, since it uses less digits than its factorization.
2121103220031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50611950 (or 50611947 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 2121103220031 its reverse (1300223011212), we get a palindrome (3421326231243).
The spelling of 2121103220031 in words is "two trillion, one hundred twenty-one billion, one hundred three million, two hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •