Base | Representation |
---|---|
bin | 101111000010111100… |
… | …0000001000110100001 |
3 | 100122202222100010001020 |
4 | 1132011320001012201 |
5 | 3123402224131423 |
6 | 114225050000053 |
7 | 10204424253516 |
oct | 1360570010641 |
9 | 318688303036 |
10 | 101030302113 |
11 | 39934a76354 |
12 | 176b6a16029 |
13 | 96b10c9270 |
14 | 4c65c1930d |
15 | 29649044e3 |
hex | 1785e011a1 |
101030302113 has 32 divisors (see below), whose sum is σ = 152340900096. Its totient is φ = 59090473728.
The previous prime is 101030302111. The next prime is 101030302127. The reversal of 101030302113 is 311203030101.
It is not a de Polignac number, because 101030302113 - 21 = 101030302111 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101030302092 and 101030302101.
It is not an unprimeable number, because it can be changed into a prime (101030302111) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 217870 + ... + 499527.
It is an arithmetic number, because the mean of its divisors is an integer number (4760653128).
Almost surely, 2101030302113 is an apocalyptic number.
101030302113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
101030302113 is a deficient number, since it is larger than the sum of its proper divisors (51310597983).
101030302113 is a wasteful number, since it uses less digits than its factorization.
101030302113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 717593.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 101030302113 its reverse (311203030101), we get a palindrome (412233332214).
The spelling of 101030302113 in words is "one hundred one billion, thirty million, three hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •