Base | Representation |
---|---|
bin | 1001000110110010000001… |
… | …1100111011001011011001 |
3 | 1022110011000101101121020202 |
4 | 2101230200130323023121 |
5 | 2303014301441022223 |
6 | 33143300141231545 |
7 | 2052231333124361 |
oct | 221544034731331 |
9 | 38404011347222 |
10 | 10012113220313 |
11 | 32101279967a6 |
12 | 11584b85625b5 |
13 | 5781a48b20c9 |
14 | 268835bbd9a1 |
15 | 1256885ca428 |
hex | 91b2073b2d9 |
10012113220313 has 8 divisors (see below), whose sum is σ = 10601833807008. Its totient is φ = 9422478494784.
The previous prime is 10012113220301. The next prime is 10012113220321. The reversal of 10012113220313 is 31302231121001.
It is a happy number.
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 10012113220313 - 214 = 10012113203929 is a prime.
It is a super-2 number, since 2×100121132203132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10012113222313) 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, 21225131 + ... + 21691712.
It is an arithmetic number, because the mean of its divisors is an integer number (1325229225876).
Almost surely, 210012113220313 is an apocalyptic number.
It is an amenable number.
10012113220313 is a deficient number, since it is larger than the sum of its proper divisors (589720586695).
10012113220313 is a wasteful number, since it uses less digits than its factorization.
10012113220313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42930583.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 10012113220313 its reverse (31302231121001), we get a palindrome (41314344341314).
The spelling of 10012113220313 in words is "ten trillion, twelve billion, one hundred thirteen million, two hundred twenty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •