Base | Representation |
---|---|
bin | 110010111110110101010000… |
… | …101011010010010001110101 |
3 | 1002101220020022202200102112120 |
4 | 302332311100223102101311 |
5 | 213342110302012241041 |
6 | 2112513145055110153 |
7 | 65141240424643344 |
oct | 6276652053222165 |
9 | 1071806282612476 |
10 | 224220121212021 |
11 | 654972460215a0 |
12 | 21193440b12359 |
13 | 9815b361c490c |
14 | 3d524516dbb5b |
15 | 1adc72ea65366 |
hex | cbed50ad2475 |
224220121212021 has 32 divisors (see below), whose sum is σ = 343309401146880. Its totient is φ = 128736625723200.
The previous prime is 224220121211987. The next prime is 224220121212119. The reversal of 224220121212021 is 120212121022422.
It is not a de Polignac number, because 224220121212021 - 27 = 224220121211893 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 224220121211982 and 224220121212000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (224220121212421) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 34025506 + ... + 40077116.
It is an arithmetic number, because the mean of its divisors is an integer number (10728418785840).
Almost surely, 2224220121212021 is an apocalyptic number.
It is an amenable number.
224220121212021 is a deficient number, since it is larger than the sum of its proper divisors (119089279934859).
224220121212021 is a wasteful number, since it uses less digits than its factorization.
224220121212021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6110737.
The product of its (nonzero) digits is 1024, while the sum is 24.
Adding to 224220121212021 its reverse (120212121022422), we get a palindrome (344432242234443).
The spelling of 224220121212021 in words is "two hundred twenty-four trillion, two hundred twenty billion, one hundred twenty-one million, two hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •