Base | Representation |
---|---|
bin | 101111000010010110… |
… | …0011110100111011101 |
3 | 100122201121002001201220 |
4 | 1132010230132213131 |
5 | 3123332142000221 |
6 | 114223101323553 |
7 | 10204064040552 |
oct | 1360454364735 |
9 | 318647061656 |
10 | 101010500061 |
11 | 39924880819 |
12 | 176b02665b9 |
13 | 96a9c84c83 |
14 | 4c63342a29 |
15 | 2962ce20c6 |
hex | 1784b1e9dd |
101010500061 has 16 divisors (see below), whose sum is σ = 136265772288. Its totient is φ = 66550248000.
The previous prime is 101010500051. The next prime is 101010500077. The reversal of 101010500061 is 160005010101.
It is not a de Polignac number, because 101010500061 - 215 = 101010467293 is a prime.
It is a super-2 number, since 2×1010105000612 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 101010500061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101010500011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 144181 + ... + 472026.
It is an arithmetic number, because the mean of its divisors is an integer number (8516610768).
Almost surely, 2101010500061 is an apocalyptic number.
It is an amenable number.
101010500061 is a deficient number, since it is larger than the sum of its proper divisors (35255272227).
101010500061 is a wasteful number, since it uses less digits than its factorization.
101010500061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 616852.
The product of its (nonzero) digits is 30, while the sum is 15.
Adding to 101010500061 its reverse (160005010101), we get a palindrome (261015510162).
The spelling of 101010500061 in words is "one hundred one billion, ten million, five hundred thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •