Base | Representation |
---|---|
bin | 10011110000111000… |
… | …01110100001001101 |
3 | 1000101110201022212200 |
4 | 21320130032201031 |
5 | 133212303200023 |
6 | 4512513552113 |
7 | 523640416626 |
oct | 117034164115 |
9 | 30343638780 |
10 | 10610600013 |
11 | 4555452922 |
12 | 2081575639 |
13 | 1001357a60 |
14 | 7292a8a4d |
15 | 4217c1743 |
hex | 27870e84d |
10610600013 has 48 divisors (see below), whose sum is σ = 16712260656. Its totient is φ = 6448066560.
The previous prime is 10610600003. The next prime is 10610600059. The reversal of 10610600013 is 31000601601.
10610600013 is a `hidden beast` number, since 1 + 0 + 61 + 0 + 600 + 0 + 1 + 3 = 666.
It can be written as a sum of positive squares in 8 ways, for example, as 129345129 + 10481254884 = 11373^2 + 102378^2 .
It is not a de Polignac number, because 10610600013 - 226 = 10543491149 is a prime.
It is a super-2 number, since 2×106106000132 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10610600003) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 7682583 + ... + 7683963.
It is an arithmetic number, because the mean of its divisors is an integer number (348172097).
Almost surely, 210610600013 is an apocalyptic number.
10610600013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10610600013 is a deficient number, since it is larger than the sum of its proper divisors (6101660643).
10610600013 is a wasteful number, since it uses less digits than its factorization.
10610600013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2174 (or 2171 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
The spelling of 10610600013 in words is "ten billion, six hundred ten million, six hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.349 sec. • engine limits •