Base | Representation |
---|---|
bin | 101110100101101111… |
… | …0010111111111100110 |
3 | 100120020200200002102120 |
4 | 1131023132113333212 |
5 | 3114400412022411 |
6 | 113543525250410 |
7 | 10141226142336 |
oct | 1351336277746 |
9 | 316220602376 |
10 | 100050501606 |
11 | 39481999770 |
12 | 17482863a06 |
13 | 9586112253 |
14 | 4bb1a490c6 |
15 | 29088b3106 |
hex | 174b797fe6 |
100050501606 has 64 divisors (see below), whose sum is σ = 229896576000. Its totient is φ = 28708192800.
The previous prime is 100050501583. The next prime is 100050501643. The reversal of 100050501606 is 606105050001.
It is a super-2 number, since 2×1000505016062 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2613141 + ... + 2651151.
It is an arithmetic number, because the mean of its divisors is an integer number (3592134000).
Almost surely, 2100050501606 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 100050501606, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (114948288000).
100050501606 is an abundant number, since it is smaller than the sum of its proper divisors (129846074394).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100050501606 is a wasteful number, since it uses less digits than its factorization.
100050501606 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40145.
The product of its (nonzero) digits is 900, while the sum is 24.
Adding to 100050501606 its reverse (606105050001), we get a palindrome (706155551607).
It can be divided in two parts, 100050501 and 606, that multiplied together give a palindrome (60630603606).
The spelling of 100050501606 in words is "one hundred billion, fifty million, five hundred one thousand, six hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •