Base | Representation |
---|---|
bin | 101111010010000001… |
… | …0000111011110100111 |
3 | 100201002020101202020001 |
4 | 1132210002013132213 |
5 | 3130421241004101 |
6 | 114351202322131 |
7 | 10223110010365 |
oct | 1364402073647 |
9 | 321066352201 |
10 | 101536266151 |
11 | 3a074636651 |
12 | 17818359347 |
13 | 9761b8bb78 |
14 | 4cb30c4635 |
15 | 2994049901 |
hex | 17a40877a7 |
101536266151 has 4 divisors (see below), whose sum is σ = 101677485600. Its totient is φ = 101395046704.
The previous prime is 101536266149. The next prime is 101536266179. The reversal of 101536266151 is 151662635101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101536266151 - 21 = 101536266149 is a prime.
It is a super-2 number, since 2×1015362661512 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101536266151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101536266191) 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 3 ways as a sum of consecutive naturals, for example, 70608646 + ... + 70610083.
It is an arithmetic number, because the mean of its divisors is an integer number (25419371400).
Almost surely, 2101536266151 is an apocalyptic number.
101536266151 is a deficient number, since it is larger than the sum of its proper divisors (141219449).
101536266151 is an equidigital number, since it uses as much as digits as its factorization.
101536266151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141219448.
The product of its (nonzero) digits is 32400, while the sum is 37.
The spelling of 101536266151 in words is "one hundred one billion, five hundred thirty-six million, two hundred sixty-six thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •