Base | Representation |
---|---|
bin | 1001100110001001100011… |
… | …10101000111100000101111 |
3 | 2202201022222101022210010211 |
4 | 10303010301311013200233 |
5 | 10231213404121130411 |
6 | 112514044004043251 |
7 | 4305366326216152 |
oct | 463046165074057 |
9 | 82638871283124 |
10 | 21102010333231 |
11 | 67a6348783153 |
12 | 2449864693527 |
13 | ba0bac7137a9 |
14 | 52d4b270dc99 |
15 | 268da208b221 |
hex | 133131d4782f |
21102010333231 has 8 divisors (see below), whose sum is σ = 21215719766880. Its totient is φ = 20988488386272.
The previous prime is 21102010333147. The next prime is 21102010333259. The reversal of 21102010333231 is 13233301020112.
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 21102010333231 - 211 = 21102010331183 is a prime.
It is a super-2 number, since 2×211020103332312 (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 (21102010333331) 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, 46645960 + ... + 47096173.
It is an arithmetic number, because the mean of its divisors is an integer number (2651964970860).
Almost surely, 221102010333231 is an apocalyptic number.
21102010333231 is a deficient number, since it is larger than the sum of its proper divisors (113709433649).
21102010333231 is an equidigital number, since it uses as much as digits as its factorization.
21102010333231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 93743345.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 21102010333231 its reverse (13233301020112), we get a palindrome (34335311353343).
The spelling of 21102010333231 in words is "twenty-one trillion, one hundred two billion, ten million, three hundred thirty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •