Base | Representation |
---|---|
bin | 1001000110101111000010… |
… | …1001001010011001011001 |
3 | 1022110001221111002210020011 |
4 | 2101223300221022121121 |
5 | 2303011131121401014 |
6 | 33143044405401521 |
7 | 2052202423321351 |
oct | 221536051123131 |
9 | 38401844083204 |
10 | 10011311122009 |
11 | 320a85615243a |
12 | 1158313a092a1 |
13 | 5780a7676122 |
14 | 26879b469b61 |
15 | 12563ce8b7c4 |
hex | 91af0a4a659 |
10011311122009 has 8 divisors (see below), whose sum is σ = 10261754318088. Its totient is φ = 9761166253440.
The previous prime is 10011311121983. The next prime is 10011311122037. The reversal of 10011311122009 is 90022111311001.
It can be written as a sum of positive squares in 4 ways, for example, as 636569409609 + 9374741712400 = 797853^2 + 3061820^2 .
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 10011311122009 - 211 = 10011311119961 is a prime.
It is a super-2 number, since 2×100113111220092 (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 (10011311122049) 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, 74513922 + ... + 74648155.
It is an arithmetic number, because the mean of its divisors is an integer number (1282719289761).
Almost surely, 210011311122009 is an apocalyptic number.
It is an amenable number.
10011311122009 is a deficient number, since it is larger than the sum of its proper divisors (250443196079).
10011311122009 is a wasteful number, since it uses less digits than its factorization.
10011311122009 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 149163755.
The product of its (nonzero) digits is 108, while the sum is 22.
The spelling of 10011311122009 in words is "ten trillion, eleven billion, three hundred eleven million, one hundred twenty-two thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •