Base | Representation |
---|---|
bin | 10011101011101000… |
… | …011010101100001111 |
3 | 2000112210200012222221 |
4 | 103223220122230033 |
5 | 321240034010111 |
6 | 13413003520211 |
7 | 1345461320455 |
oct | 235350325417 |
9 | 60483605887 |
10 | 21133110031 |
11 | 8a650a93a0 |
12 | 4119529067 |
13 | 1cba37c047 |
14 | 10469a29d5 |
15 | 83a492371 |
hex | 4eba1ab0f |
21133110031 has 24 divisors (see below), whose sum is σ = 24391272528. Its totient is φ = 18156096000.
The previous prime is 21133110001. The next prime is 21133110041. The reversal of 21133110031 is 13001133112.
It is not a de Polignac number, because 21133110031 - 215 = 21133077263 is a prime.
It is a super-2 number, since 2×211331100312 (a number of 21 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 = 21133109987 and 21133110014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21133110001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1665471 + ... + 1678111.
It is an arithmetic number, because the mean of its divisors is an integer number (1016303022).
Almost surely, 221133110031 is an apocalyptic number.
21133110031 is a deficient number, since it is larger than the sum of its proper divisors (3258162497).
21133110031 is a wasteful number, since it uses less digits than its factorization.
21133110031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13111 (or 13092 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 21133110031 its reverse (13001133112), we get a palindrome (34134243143).
The spelling of 21133110031 in words is "twenty-one billion, one hundred thirty-three million, one hundred ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •