Base | Representation |
---|---|
bin | 10010101000101111… |
… | …11110010111011101 |
3 | 221211022010100020211 |
4 | 21110113332113131 |
5 | 130442402134001 |
6 | 4332500412421 |
7 | 502642251655 |
oct | 112427762735 |
9 | 27738110224 |
10 | 10005505501 |
11 | 4274935412 |
12 | 1b329a7111 |
13 | c35b97374 |
14 | 6acb97365 |
15 | 3d85e9351 |
hex | 2545fe5dd |
10005505501 has 8 divisors (see below), whose sum is σ = 10326961440. Its totient is φ = 9689112048.
The previous prime is 10005505459. The next prime is 10005505513. The reversal of 10005505501 is 10550550001.
10005505501 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 10005505501 - 215 = 10005472733 is a prime.
It is a super-2 number, since 2×100055055012 (a number of 21 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 (10005505591) 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, 1261606 + ... + 1269511.
It is an arithmetic number, because the mean of its divisors is an integer number (1290870180).
Almost surely, 210005505501 is an apocalyptic number.
It is an amenable number.
10005505501 is a deficient number, since it is larger than the sum of its proper divisors (321455939).
10005505501 is an equidigital number, since it uses as much as digits as its factorization.
10005505501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2531243.
The product of its (nonzero) digits is 625, while the sum is 22.
Multiplying 10005505501 by its sum of digits (22), we get a palindrome (220121121022).
The spelling of 10005505501 in words is "ten billion, five million, five hundred five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •