Base | Representation |
---|---|
bin | 1001101001000101101110… |
… | …00101101101011000111111 |
3 | 2210001222201122012211001210 |
4 | 10310202313011231120333 |
5 | 10234342301224101343 |
6 | 113032312044335503 |
7 | 4315603566606312 |
oct | 464426705553077 |
9 | 83058648184053 |
10 | 21203030300223 |
11 | 683517792a582 |
12 | 2465357b44593 |
13 | baa58b6317a5 |
14 | 534336dd8979 |
15 | 26b815aed333 |
hex | 1348b716d63f |
21203030300223 has 8 divisors (see below), whose sum is σ = 29034780231088. Its totient is φ = 13753316951424.
The previous prime is 21203030300159. The next prime is 21203030300293. The reversal of 21203030300223 is 32200303030212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21203030300223 - 26 = 21203030300159 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 21203030300223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21203030300293) 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, 95509145386 + ... + 95509145607.
It is an arithmetic number, because the mean of its divisors is an integer number (3629347528886).
Almost surely, 221203030300223 is an apocalyptic number.
21203030300223 is a deficient number, since it is larger than the sum of its proper divisors (7831749930865).
21203030300223 is a wasteful number, since it uses less digits than its factorization.
21203030300223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191018291033.
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 21203030300223 its reverse (32200303030212), we get a palindrome (53403333330435).
The spelling of 21203030300223 in words is "twenty-one trillion, two hundred three billion, thirty million, three hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •