Base | Representation |
---|---|
bin | 1001000110101010001010… |
… | …0011111010001011010001 |
3 | 1022102221120012002220001100 |
4 | 2101222202203322023101 |
5 | 2303000440241401001 |
6 | 33142310411455013 |
7 | 2052125105441346 |
oct | 221524243721321 |
9 | 38387505086040 |
10 | 10010001122001 |
11 | 320a243745001 |
12 | 1158009157469 |
13 | 577c291495aa |
14 | 2686b54a47cd |
15 | 1255b2e73586 |
hex | 91aa28fa2d1 |
10010001122001 has 12 divisors (see below), whose sum is σ = 15087537923328. Its totient is φ = 6383189121144.
The previous prime is 10010001121957. The next prime is 10010001122003. The reversal of 10010001122001 is 10022110001001.
It is a happy number.
It is not a de Polignac number, because 10010001122001 - 29 = 10010001121489 is a prime.
It is a super-2 number, since 2×100100011220012 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (10010001122003) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 24178746465 + ... + 24178746878.
It is an arithmetic number, because the mean of its divisors is an integer number (1257294826944).
Almost surely, 210010001122001 is an apocalyptic number.
It is an amenable number.
10010001122001 is a deficient number, since it is larger than the sum of its proper divisors (5077536801327).
10010001122001 is a wasteful number, since it uses less digits than its factorization.
10010001122001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48357493372 (or 48357493369 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10010001122001 its reverse (10022110001001), we get a palindrome (20032111123002).
The spelling of 10010001122001 in words is "ten trillion, ten billion, one million, one hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •