Base | Representation |
---|---|
bin | 1001010010111100100100… |
… | …0110011011001110111111 |
3 | 1100012010110002221222120122 |
4 | 2110233021012123032333 |
5 | 2314430303340231030 |
6 | 33423301541005155 |
7 | 2103310261611206 |
oct | 224571106331677 |
9 | 40163402858518 |
10 | 10221101102015 |
11 | 3290821121501 |
12 | 1190b020b37bb |
13 | 591acbcca77b |
14 | 2749bd84023d |
15 | 12ad1ab358e5 |
hex | 94bc919b3bf |
10221101102015 has 16 divisors (see below), whose sum is σ = 12986941820832. Its totient is φ = 7695810253824.
The previous prime is 10221101101949. The next prime is 10221101102041. The reversal of 10221101102015 is 51020110112201.
It is a cyclic number.
It is not a de Polignac number, because 10221101102015 - 238 = 9946223195071 is a prime.
It is a super-2 number, since 2×102211011020152 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10221101101984 and 10221101102002.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8705027 + ... + 9809163.
It is an arithmetic number, because the mean of its divisors is an integer number (811683863802).
Almost surely, 210221101102015 is an apocalyptic number.
10221101102015 is a deficient number, since it is larger than the sum of its proper divisors (2765840718817).
10221101102015 is a wasteful number, since it uses less digits than its factorization.
10221101102015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1213066.
The product of its (nonzero) digits is 40, while the sum is 17.
Adding to 10221101102015 its reverse (51020110112201), we get a palindrome (61241211214216).
The spelling of 10221101102015 in words is "ten trillion, two hundred twenty-one billion, one hundred one million, one hundred two thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •