Base | Representation |
---|---|
bin | 1001101001010100100101… |
… | …01110001111011011110111 |
3 | 2210002202022202121210121221 |
4 | 10310222102232033123313 |
5 | 10240010122041244111 |
6 | 113040111543251211 |
7 | 4316305414036450 |
oct | 464522256173367 |
9 | 83082282553557 |
10 | 21211010103031 |
11 | 68385a2262531 |
12 | 2466a04449b07 |
13 | bab2609227b8 |
14 | 534892b26127 |
15 | 26bb31459371 |
hex | 134a92b8f6f7 |
21211010103031 has 16 divisors (see below), whose sum is σ = 24426817865280. Its totient is φ = 18041712998400.
The previous prime is 21211010103013. The next prime is 21211010103043. The reversal of 21211010103031 is 13030101011212.
It is a happy number.
It is not a de Polignac number, because 21211010103031 - 29 = 21211010102519 is a prime.
It is a super-2 number, since 2×212110101030312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21211010102996 and 21211010103014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21211010103001) 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, 1262046 + ... + 6634363.
It is an arithmetic number, because the mean of its divisors is an integer number (1526676116580).
Almost surely, 221211010103031 is an apocalyptic number.
21211010103031 is a deficient number, since it is larger than the sum of its proper divisors (3215807762249).
21211010103031 is a wasteful number, since it uses less digits than its factorization.
21211010103031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7899354.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 21211010103031 its reverse (13030101011212), we get a palindrome (34241111114243).
The spelling of 21211010103031 in words is "twenty-one trillion, two hundred eleven billion, ten million, one hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •