Base | Representation |
---|---|
bin | 1001000110000101010011… |
… | …0001001101001111000101 |
3 | 1022102000000120210011202201 |
4 | 2101201110301031033011 |
5 | 2302320204122104001 |
6 | 33133552454034501 |
7 | 2051324643636400 |
oct | 221412461151705 |
9 | 38360016704681 |
10 | 10000106050501 |
11 | 3206026188366 |
12 | 1156107348a31 |
13 | 577010109cb8 |
14 | 268017256d37 |
15 | 1251d43e0501 |
hex | 91854c4d3c5 |
10000106050501 has 24 divisors (see below), whose sum is σ = 12777420358080. Its totient is φ = 7767326552832.
The previous prime is 10000106050481. The next prime is 10000106050591. The reversal of 10000106050501 is 10505060100001.
It is not a de Polignac number, because 10000106050501 - 27 = 10000106050373 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10000106050591) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 233484076 + ... + 233526901.
It is an arithmetic number, because the mean of its divisors is an integer number (532392514920).
Almost surely, 210000106050501 is an apocalyptic number.
It is an amenable number.
10000106050501 is a deficient number, since it is larger than the sum of its proper divisors (2777314307579).
10000106050501 is a wasteful number, since it uses less digits than its factorization.
10000106050501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 467011033 (or 467011026 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 19.
Adding to 10000106050501 its reverse (10505060100001), we get a palindrome (20505166150502).
The spelling of 10000106050501 in words is "ten trillion, one hundred six million, fifty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •