Base | Representation |
---|---|
bin | 1001000111010011111101… |
… | …0101110111111010011111 |
3 | 1022111000112011001002012102 |
4 | 2101310333111313322133 |
5 | 2303141430134301343 |
6 | 33151404025155315 |
7 | 2053003131306635 |
oct | 221647725677237 |
9 | 38430464032172 |
10 | 10021221400223 |
11 | 3213a81256110 |
12 | 115a21a92bb3b |
13 | 578cc68ab187 |
14 | 26905b715355 |
15 | 125a1d0253b8 |
hex | 91d3f577e9f |
10021221400223 has 16 divisors (see below), whose sum is σ = 10953724608000. Its totient is φ = 9092302639200.
The previous prime is 10021221400213. The next prime is 10021221400231. The reversal of 10021221400223 is 32200412212001.
It is not a de Polignac number, because 10021221400223 - 232 = 10016926432927 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10021221400195 and 10021221400204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10021221400213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 53459486 + ... + 53646612.
It is an arithmetic number, because the mean of its divisors is an integer number (684607788000).
Almost surely, 210021221400223 is an apocalyptic number.
10021221400223 is a deficient number, since it is larger than the sum of its proper divisors (932503207777).
10021221400223 is a wasteful number, since it uses less digits than its factorization.
10021221400223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 196678.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 10021221400223 its reverse (32200412212001), we get a palindrome (42221633612224).
The spelling of 10021221400223 in words is "ten trillion, twenty-one billion, two hundred twenty-one million, four hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •