Base | Representation |
---|---|
bin | 1001100100001001001110… |
… | …00011100110010100100010 |
3 | 2202110202010121101110020010 |
4 | 10302010213003212110202 |
5 | 10224101302141301310 |
6 | 112422251041025350 |
7 | 4300410035014263 |
oct | 462044703462442 |
9 | 82422117343203 |
10 | 21033110103330 |
11 | 677a101359696 |
12 | 2438436025256 |
13 | b9754c0992a0 |
14 | 52a017bb696a |
15 | 2671bd2b8320 |
hex | 1321270e6522 |
21033110103330 has 32 divisors (see below), whose sum is σ = 54362499960384. Its totient is φ = 5177380948416.
The previous prime is 21033110103329. The next prime is 21033110103331. The reversal of 21033110103330 is 3330101133012.
It is an interprime number because it is at equal distance from previous prime (21033110103329) and next prime (21033110103331).
It is a junction number, because it is equal to n+sod(n) for n = 21033110103297 and 21033110103306.
It is not an unprimeable number, because it can be changed into a prime (21033110103331) 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, 26965525384 + ... + 26965526163.
It is an arithmetic number, because the mean of its divisors is an integer number (1698828123762).
Almost surely, 221033110103330 is an apocalyptic number.
21033110103330 is an abundant number, since it is smaller than the sum of its proper divisors (33329389857054).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21033110103330 is a wasteful number, since it uses less digits than its factorization.
21033110103330 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53931051570.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 21033110103330 its reverse (3330101133012), we get a palindrome (24363211236342).
The spelling of 21033110103330 in words is "twenty-one trillion, thirty-three billion, one hundred ten million, one hundred three thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •