Base | Representation |
---|---|
bin | 1001100011110011000010… |
… | …0111000000011011011111 |
3 | 1101012210200211011102021020 |
4 | 2120330300213000123133 |
5 | 2334201202212130210 |
6 | 34204300405535223 |
7 | 2133236323130340 |
oct | 230746047003337 |
9 | 41183624142236 |
10 | 10510600505055 |
11 | 339257aa798a2 |
12 | 1219036a14513 |
13 | 5b31b75081a1 |
14 | 284a041500c7 |
15 | 133611501770 |
hex | 98f309c06df |
10510600505055 has 64 divisors (see below), whose sum is σ = 19669843995648. Its totient is φ = 4692270643200.
The previous prime is 10510600505047. The next prime is 10510600505059. The reversal of 10510600505055 is 55050500601501.
10510600505055 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10510600505055 - 23 = 10510600505047 is a prime.
It is a super-2 number, since 2×105106005050552 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10510600505059) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 25535847 + ... + 25944183.
It is an arithmetic number, because the mean of its divisors is an integer number (307341312432).
Almost surely, 210510600505055 is an apocalyptic number.
10510600505055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10510600505055 is a deficient number, since it is larger than the sum of its proper divisors (9159243490593).
10510600505055 is a wasteful number, since it uses less digits than its factorization.
10510600505055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 414096.
The product of its (nonzero) digits is 18750, while the sum is 33.
The spelling of 10510600505055 in words is "ten trillion, five hundred ten billion, six hundred million, five hundred five thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •