Base | Representation |
---|---|
bin | 1001001100011111000110… |
… | …0000111110010111100101 |
3 | 1022210111221221121211200020 |
4 | 2103013301200332113211 |
5 | 2311121001130004423 |
6 | 33300304224305353 |
7 | 2062300644041250 |
oct | 223076140762745 |
9 | 38714857554606 |
10 | 10110110000613 |
11 | 3248745586227 |
12 | 11734a7472259 |
13 | 5844c138ab3c |
14 | 26d490b88097 |
15 | 127ec1a184e3 |
hex | 931f183e5e5 |
10110110000613 has 32 divisors (see below), whose sum is σ = 15414775296000. Its totient is φ = 5773871704320.
The previous prime is 10110110000611. The next prime is 10110110000681. The reversal of 10110110000613 is 31600001101101.
It is not a de Polignac number, because 10110110000613 - 21 = 10110110000611 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10110110000592 and 10110110000601.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10110110000611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 293275968 + ... + 293310438.
It is an arithmetic number, because the mean of its divisors is an integer number (481711728000).
Almost surely, 210110110000613 is an apocalyptic number.
It is an amenable number.
10110110000613 is a deficient number, since it is larger than the sum of its proper divisors (5304665295387).
10110110000613 is a wasteful number, since it uses less digits than its factorization.
10110110000613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42137.
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 10110110000613 its reverse (31600001101101), we get a palindrome (41710111101714).
The spelling of 10110110000613 in words is "ten trillion, one hundred ten billion, one hundred ten million, six hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •