Base | Representation |
---|---|
bin | 1001100011001101110011… |
… | …10110111101000111100111 |
3 | 2202100200210122221000112010 |
4 | 10301212321312331013213 |
5 | 10223040441101114343 |
6 | 112355454005525303 |
7 | 4265200433455161 |
oct | 461467166750747 |
9 | 82320718830463 |
10 | 21001213301223 |
11 | 6767623454111 |
12 | 2432213a13833 |
13 | b94537a5009c |
14 | 52866d897931 |
15 | 266452db3d33 |
hex | 1319b9dbd1e7 |
21001213301223 has 8 divisors (see below), whose sum is σ = 28001664781936. Its totient is φ = 14000785344000.
The previous prime is 21001213301221. The next prime is 21001213301231. The reversal of 21001213301223 is 32210331210012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21001213301223 - 21 = 21001213301221 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 21001213301223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21001213301221) 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, 3680068 + ... + 7452873.
It is an arithmetic number, because the mean of its divisors is an integer number (3500208097742).
Almost surely, 221001213301223 is an apocalyptic number.
21001213301223 is a deficient number, since it is larger than the sum of its proper divisors (7000451480713).
21001213301223 is a wasteful number, since it uses less digits than its factorization.
21001213301223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11761745.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 21001213301223 its reverse (32210331210012), we get a palindrome (53211544511235).
The spelling of 21001213301223 in words is "twenty-one trillion, one billion, two hundred thirteen million, three hundred one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •