Base | Representation |
---|---|
bin | 1001100110000110000011… |
… | …10100110011100010010111 |
3 | 2202201011010102102002101010 |
4 | 10303003001310303202113 |
5 | 10231201032042000343 |
6 | 112513133315503303 |
7 | 4305301630661052 |
oct | 463030164634227 |
9 | 82634112362333 |
10 | 21100131203223 |
11 | 67a5573a91a46 |
12 | 244941b2b7b33 |
13 | ba0970309347 |
14 | 52d374d19a99 |
15 | 268ce2101d33 |
hex | 1330c1d33897 |
21100131203223 has 4 divisors (see below), whose sum is σ = 28133508270968. Its totient is φ = 14066754135480.
The previous prime is 21100131203219. The next prime is 21100131203233. The reversal of 21100131203223 is 32230213100112.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 21100131203223 - 22 = 21100131203219 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 21100131203223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21100131203233) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3516688533868 + ... + 3516688533873.
It is an arithmetic number, because the mean of its divisors is an integer number (7033377067742).
Almost surely, 221100131203223 is an apocalyptic number.
21100131203223 is a deficient number, since it is larger than the sum of its proper divisors (7033377067745).
21100131203223 is an equidigital number, since it uses as much as digits as its factorization.
21100131203223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7033377067744.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 21100131203223 its reverse (32230213100112), we get a palindrome (53330344303335).
The spelling of 21100131203223 in words is "twenty-one trillion, one hundred billion, one hundred thirty-one million, two hundred three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •