Base | Representation |
---|---|
bin | 1001000110001001000101… |
… | …0100110000000001110101 |
3 | 1022102002122101110210212110 |
4 | 2101202101110300001311 |
5 | 2302324244213013023 |
6 | 33134241345241233 |
7 | 2051362061242263 |
oct | 221422124600165 |
9 | 38362571423773 |
10 | 10001122001013 |
11 | 32064a7705a90 |
12 | 115634b633219 |
13 | 577142740350 |
14 | 2680b2157433 |
15 | 1252436c2a93 |
hex | 91891530075 |
10001122001013 has 32 divisors (see below), whose sum is σ = 16206303335040. Its totient is φ = 5402101098240.
The previous prime is 10001122000979. The next prime is 10001122001099. The reversal of 10001122001013 is 31010022110001.
It is not a de Polignac number, because 10001122001013 - 224 = 10001105223797 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10001122001013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10001122001713) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 401929606 + ... + 401954487.
It is an arithmetic number, because the mean of its divisors is an integer number (506446979220).
Almost surely, 210001122001013 is an apocalyptic number.
10001122001013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10001122001013 is a deficient number, since it is larger than the sum of its proper divisors (6205181334027).
10001122001013 is a wasteful number, since it uses less digits than its factorization.
10001122001013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 803884149.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 10001122001013 its reverse (31010022110001), we get a palindrome (41011144111014).
The spelling of 10001122001013 in words is "ten trillion, one billion, one hundred twenty-two million, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •