Base | Representation |
---|---|
bin | 1001001001100101000001… |
… | …0110100111100010001011 |
3 | 1022121202000221201210121012 |
4 | 2102121100112213202023 |
5 | 2304311202321413421 |
6 | 33221324023034135 |
7 | 2055552115644206 |
oct | 222312026474213 |
9 | 38552027653535 |
10 | 10060161513611 |
11 | 32295439a7700 |
12 | 116588789b94b |
13 | 57c8911b60a1 |
14 | 26acb322693d |
15 | 126a4b94b95b |
hex | 926505a788b |
10060161513611 has 48 divisors (see below), whose sum is σ = 12310624257120. Its totient is φ = 8174564428800.
The previous prime is 10060161513607. The next prime is 10060161513643. The reversal of 10060161513611 is 11631516106001.
It is not a de Polignac number, because 10060161513611 - 22 = 10060161513607 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10060161513601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2256500 + ... + 5021166.
It is an arithmetic number, because the mean of its divisors is an integer number (256471338690).
Almost surely, 210060161513611 is an apocalyptic number.
10060161513611 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10060161513611 is a deficient number, since it is larger than the sum of its proper divisors (2250462743509).
10060161513611 is a wasteful number, since it uses less digits than its factorization.
10060161513611 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2764796 (or 2764785 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 32.
Adding to 10060161513611 its reverse (11631516106001), we get a palindrome (21691677619612).
The spelling of 10060161513611 in words is "ten trillion, sixty billion, one hundred sixty-one million, five hundred thirteen thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •