Base | Representation |
---|---|
bin | 1001101001111100000110… |
… | …0011100100100110011011 |
3 | 1101120220001001202010101121 |
4 | 2122133001203210212123 |
5 | 2342413244022003214 |
6 | 34324550241030111 |
7 | 2143663066000330 |
oct | 232370143444633 |
9 | 41526031663347 |
10 | 10616111516059 |
11 | 34232a420a045 |
12 | 1235582325337 |
13 | 5c01309b538a |
14 | 289b73092987 |
15 | 136239483424 |
hex | 9a7c18e499b |
10616111516059 has 8 divisors (see below), whose sum is σ = 12134989402848. Its totient is φ = 9097806261120.
The previous prime is 10616111516009. The next prime is 10616111516113. The reversal of 10616111516059 is 95061511161601.
10616111516059 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10616111516059 - 213 = 10616111507867 is a prime.
It is a super-2 number, since 2×106161115160592 (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 (10616111516009) 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, 143118232 + ... + 143192389.
It is an arithmetic number, because the mean of its divisors is an integer number (1516873675356).
Almost surely, 210616111516059 is an apocalyptic number.
10616111516059 is a deficient number, since it is larger than the sum of its proper divisors (1518877886789).
10616111516059 is an equidigital number, since it uses as much as digits as its factorization.
10616111516059 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 286315925.
The product of its (nonzero) digits is 48600, while the sum is 43.
The spelling of 10616111516059 in words is "ten trillion, six hundred sixteen billion, one hundred eleven million, five hundred sixteen thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •