Base | Representation |
---|---|
bin | 1001001100100000111101… |
… | …01000101011110011010111 |
3 | 2122121010111120221110011202 |
4 | 10212100132220223303113 |
5 | 10122301024310324343 |
6 | 111001300014423115 |
7 | 4154635453054550 |
oct | 446203650536327 |
9 | 78533446843152 |
10 | 20221220011223 |
11 | 64968535917a0 |
12 | 2327011801a9b |
13 | b38b1198a56a |
14 | 4dc9d8683327 |
15 | 251001215db8 |
hex | 12641ea2bcd7 |
20221220011223 has 32 divisors (see below), whose sum is σ = 25340525388288. Its totient is φ = 15675771888000.
The previous prime is 20221220011211. The next prime is 20221220011261. The reversal of 20221220011223 is 32211002212202.
It is not a de Polignac number, because 20221220011223 - 230 = 20220146269399 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20221220011195 and 20221220011204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20221220211223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 292742336 + ... + 292811402.
It is an arithmetic number, because the mean of its divisors is an integer number (791891418384).
Almost surely, 220221220011223 is an apocalyptic number.
20221220011223 is a deficient number, since it is larger than the sum of its proper divisors (5119305377065).
20221220011223 is a wasteful number, since it uses less digits than its factorization.
20221220011223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88583.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 20221220011223 its reverse (32211002212202), we get a palindrome (52432222223425).
The spelling of 20221220011223 in words is "twenty trillion, two hundred twenty-one billion, two hundred twenty million, eleven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •