Base | Representation |
---|---|
bin | 1001000111010000001110… |
… | …1110011111100011111000 |
3 | 1022110220221110000201101122 |
4 | 2101310003232133203320 |
5 | 2303132403113033422 |
6 | 33151120500004412 |
7 | 2052636265031564 |
oct | 221640356374370 |
9 | 38426843021348 |
10 | 10020221221112 |
11 | 321360871a803 |
12 | 1159b9b990708 |
13 | 578b9760a60b |
14 | 268da495c6a4 |
15 | 1259b030ad42 |
hex | 91d03b9f8f8 |
10020221221112 has 8 divisors (see below), whose sum is σ = 18787914789600. Its totient is φ = 5010110610552.
The previous prime is 10020221221091. The next prime is 10020221221133. The reversal of 10020221221112 is 21112212202001.
It is an interprime number because it is at equal distance from previous prime (10020221221091) and next prime (10020221221133).
It is a tau number, because it is divible by the number of its divisors (8).
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 626263826312 + ... + 626263826327.
It is an arithmetic number, because the mean of its divisors is an integer number (2348489348700).
Almost surely, 210020221221112 is an apocalyptic number.
It is an amenable number.
10020221221112 is a deficient number, since it is larger than the sum of its proper divisors (8767693568488).
10020221221112 is a wasteful number, since it uses less digits than its factorization.
10020221221112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1252527652645 (or 1252527652641 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 10020221221112 its reverse (21112212202001), we get a palindrome (31132433423113).
The spelling of 10020221221112 in words is "ten trillion, twenty billion, two hundred twenty-one million, two hundred twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •