Base | Representation |
---|---|
bin | 10011101010010000… |
… | …011000101001111101 |
3 | 2000111012020210021212 |
4 | 103222100120221331 |
5 | 321213132024041 |
6 | 13410421134205 |
7 | 1345061214530 |
oct | 235220305175 |
9 | 60435223255 |
10 | 21110033021 |
11 | 8a53077290 |
12 | 411185a365 |
13 | 1cb565c1cc |
14 | 10438b6a17 |
15 | 8384348eb |
hex | 4ea418a7d |
21110033021 has 16 divisors (see below), whose sum is σ = 27030330240. Its totient is φ = 16004796480.
The previous prime is 21110032997. The next prime is 21110033053. The reversal of 21110033021 is 12033001112.
It is a cyclic number.
It is not a de Polignac number, because 21110033021 - 226 = 21042924157 is a prime.
It is a super-3 number, since 3×211100330213 (a number of 32 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21110032987 and 21110033005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21110033921) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3701966 + ... + 3707663.
It is an arithmetic number, because the mean of its divisors is an integer number (1689395640).
Almost surely, 221110033021 is an apocalyptic number.
It is an amenable number.
21110033021 is a deficient number, since it is larger than the sum of its proper divisors (5920297219).
21110033021 is a wasteful number, since it uses less digits than its factorization.
21110033021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7409684.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 21110033021 its reverse (12033001112), we get a palindrome (33143034133).
The spelling of 21110033021 in words is "twenty-one billion, one hundred ten million, thirty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •