Base | Representation |
---|---|
bin | 1001000110001000101000… |
… | …0111100011101110001101 |
3 | 1022102002022221222111220102 |
4 | 2101202022013203232031 |
5 | 2302324022240232341 |
6 | 33134221350100445 |
7 | 2051356062515543 |
oct | 221421207435615 |
9 | 38362287874812 |
10 | 10001001102221 |
11 | 320644543aa28 |
12 | 115631704a725 |
13 | 5771236902bc |
14 | 2680a0085d93 |
15 | 125237c90c9b |
hex | 9188a1e3b8d |
10001001102221 has 8 divisors (see below), whose sum is σ = 10018907774400. Its totient is φ = 9983097387648.
The previous prime is 10001001102203. The next prime is 10001001102277. The reversal of 10001001102221 is 12220110010001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10001001102221 - 226 = 10000933993357 is a prime.
It is a super-2 number, since 2×100010011022212 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10001001108221) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6085880 + ... + 7552478.
It is an arithmetic number, because the mean of its divisors is an integer number (1252363471800).
Almost surely, 210001001102221 is an apocalyptic number.
It is an amenable number.
10001001102221 is a deficient number, since it is larger than the sum of its proper divisors (17906672179).
10001001102221 is a wasteful number, since it uses less digits than its factorization.
10001001102221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1478803.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10001001102221 its reverse (12220110010001), we get a palindrome (22221111112222).
The spelling of 10001001102221 in words is "ten trillion, one billion, one million, one hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •