Base | Representation |
---|---|
bin | 1001100100001001110100… |
… | …01100000111001010011111 |
3 | 2202110202221222101212202212 |
4 | 10302010322030013022133 |
5 | 10224102431330231421 |
6 | 112422342545111035 |
7 | 4300421013322631 |
oct | 462047214071237 |
9 | 82422858355685 |
10 | 21033431102111 |
11 | 677a25657583a |
12 | 243850562847b |
13 | b975a0739cac |
14 | 52a048694a51 |
15 | 2671db573e5b |
hex | 13213a30729f |
21033431102111 has 8 divisors (see below), whose sum is σ = 21758889972000. Its totient is φ = 20307983441760.
The previous prime is 21033431102107. The next prime is 21033431102119. The reversal of 21033431102111 is 11120113433012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21033431102111 - 22 = 21033431102107 is a prime.
It is a super-2 number, since 2×210334311021112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21033431102119) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1107590 + ... + 6579788.
It is an arithmetic number, because the mean of its divisors is an integer number (2719861246500).
Almost surely, 221033431102111 is an apocalyptic number.
21033431102111 is a deficient number, since it is larger than the sum of its proper divisors (725458869889).
21033431102111 is a wasteful number, since it uses less digits than its factorization.
21033431102111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5604769.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 21033431102111 its reverse (11120113433012), we get a palindrome (32153544535123).
The spelling of 21033431102111 in words is "twenty-one trillion, thirty-three billion, four hundred thirty-one million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •