Base | Representation |
---|---|
bin | 1001101001010010101101… |
… | …0010011100101010010101 |
3 | 1101112211100201102112121102 |
4 | 2122110223102130222111 |
5 | 2342223020112310401 |
6 | 34315511525355445 |
7 | 2143120541003054 |
oct | 232245322345225 |
9 | 41484321375542 |
10 | 10605000510101 |
11 | 3419612352898 |
12 | 12333a1268b85 |
13 | 5bc07ca9283a |
14 | 2893db56839b |
15 | 135cd8cb856b |
hex | 9a52b49ca95 |
10605000510101 has 8 divisors (see below), whose sum is σ = 10763618065824. Its totient is φ = 10446392777040.
The previous prime is 10605000510053. The next prime is 10605000510233. The reversal of 10605000510101 is 10101500050601.
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 10605000510101 - 242 = 6206953998997 is a prime.
It is a super-2 number, since 2×106050005101012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10605000410101) 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, 265730 + ... + 4613091.
It is an arithmetic number, because the mean of its divisors is an integer number (1345452258228).
Almost surely, 210605000510101 is an apocalyptic number.
It is an amenable number.
10605000510101 is a deficient number, since it is larger than the sum of its proper divisors (158617555723).
10605000510101 is an equidigital number, since it uses as much as digits as its factorization.
10605000510101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4911331.
The product of its (nonzero) digits is 150, while the sum is 20.
Adding to 10605000510101 its reverse (10101500050601), we get a palindrome (20706500560702).
The spelling of 10605000510101 in words is "ten trillion, six hundred five billion, five hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •