Base | Representation |
---|---|
bin | 1001100011001011111011… |
… | …00010011111000011001111 |
3 | 2202100121012010200010212200 |
4 | 10301211331202133003033 |
5 | 10223031403013132343 |
6 | 112355205335132543 |
7 | 4265133364560603 |
oct | 461457542370317 |
9 | 82317163603780 |
10 | 21000201302223 |
11 | 6767154185300 |
12 | 2431b90b14153 |
13 | b944061a1500 |
14 | 5285b5305503 |
15 | 2663e41124d3 |
hex | 13197d89f0cf |
21000201302223 has 54 divisors (see below), whose sum is σ = 36103970048328. Its totient is φ = 11748364261920.
The previous prime is 21000201302083. The next prime is 21000201302237. The reversal of 21000201302223 is 32220310200012.
21000201302223 is a `hidden beast` number, since 210 + 0 + 0 + 201 + 30 + 2 + 223 = 666.
It is not a de Polignac number, because 21000201302223 - 29 = 21000201301711 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21000201302196 and 21000201302205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21000201304223) by changing a digit.
It is a polite number, since it can be written in 53 ways as a sum of consecutive naturals, for example, 56869011 + ... + 57237092.
It is an arithmetic number, because the mean of its divisors is an integer number (668592037932).
Almost surely, 221000201302223 is an apocalyptic number.
21000201302223 is a deficient number, since it is larger than the sum of its proper divisors (15103768746105).
21000201302223 is a wasteful number, since it uses less digits than its factorization.
21000201302223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114106157 (or 114106130 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 21000201302223 its reverse (32220310200012), we get a palindrome (53220511502235).
The spelling of 21000201302223 in words is "twenty-one trillion, two hundred one million, three hundred two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •