Base | Representation |
---|---|
bin | 1001000111100110001011… |
… | …0100101111010100000001 |
3 | 1022111111010221221002021112 |
4 | 2101321202310233110001 |
5 | 2303231434041130223 |
6 | 33153533200333105 |
7 | 2053235251660616 |
oct | 221714264572401 |
9 | 38444127832245 |
10 | 10026111661313 |
11 | 321606071a700 |
12 | 115b164614195 |
13 | 5795c5a964a7 |
14 | 2693a2dac50d |
15 | 125c07501778 |
hex | 91e62d2f501 |
10026111661313 has 6 divisors (see below), whose sum is σ = 11020436784882. Its totient is φ = 9114646964720.
The previous prime is 10026111661297. The next prime is 10026111661331. The reversal of 10026111661313 is 31316611162001.
It can be written as a sum of positive squares in only one way, i.e., 8947654335169 + 1078457326144 = 2991263^2 + 1038488^2 .
It is not a de Polignac number, because 10026111661313 - 24 = 10026111661297 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10026111661313.
It is not an unprimeable number, because it can be changed into a prime (10026111661343) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 41430213356 + ... + 41430213597.
It is an arithmetic number, because the mean of its divisors is an integer number (1836739464147).
Almost surely, 210026111661313 is an apocalyptic number.
It is an amenable number.
10026111661313 is a deficient number, since it is larger than the sum of its proper divisors (994325123569).
10026111661313 is an equidigital number, since it uses as much as digits as its factorization.
10026111661313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82860426975 (or 82860426964 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 32.
The spelling of 10026111661313 in words is "ten trillion, twenty-six billion, one hundred eleven million, six hundred sixty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •