Base | Representation |
---|---|
bin | 101111010010000000… |
… | …0100111011011101101 |
3 | 100201002012122202120121 |
4 | 1132210000213123231 |
5 | 3130421140411444 |
6 | 114351150044541 |
7 | 10223103451423 |
oct | 1364400473355 |
9 | 321065582517 |
10 | 101535872749 |
11 | 3a074398023 |
12 | 178181a9751 |
13 | 9761a81a9c |
14 | 4cb3021113 |
15 | 2993ebd084 |
hex | 17a40276ed |
101535872749 has 16 divisors (see below), whose sum is σ = 115214842368. Its totient is φ = 88937747712.
The previous prime is 101535872731. The next prime is 101535872759. The reversal of 101535872749 is 947278535101.
It is a cyclic number.
It is not a de Polignac number, because 101535872749 - 213 = 101535864557 is a prime.
It is a super-2 number, since 2×1015358727492 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101535872696 and 101535872705.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101535872759) 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 15 ways as a sum of consecutive naturals, for example, 3494757 + ... + 3523690.
It is an arithmetic number, because the mean of its divisors is an integer number (7200927648).
Almost surely, 2101535872749 is an apocalyptic number.
It is an amenable number.
101535872749 is a deficient number, since it is larger than the sum of its proper divisors (13678969619).
101535872749 is a wasteful number, since it uses less digits than its factorization.
101535872749 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7018524.
The product of its (nonzero) digits is 2116800, while the sum is 52.
The spelling of 101535872749 in words is "one hundred one billion, five hundred thirty-five million, eight hundred seventy-two thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •