Base | Representation |
---|---|
bin | 101111010010000001… |
… | …0000011010000000110 |
3 | 100201002020100212110211 |
4 | 1132210002003100012 |
5 | 3130421234430323 |
6 | 114351202110034 |
7 | 10223106606043 |
oct | 1364402032006 |
9 | 321066325424 |
10 | 101536248838 |
11 | 3a074624642 |
12 | 1781834b31a |
13 | 9761b8401b |
14 | 4cb30bc1ca |
15 | 299404470d |
hex | 17a4083406 |
101536248838 has 4 divisors (see below), whose sum is σ = 152304373260. Its totient is φ = 50768124418.
The previous prime is 101536248829. The next prime is 101536248901. The reversal of 101536248838 is 838842635101.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 838842635101 = 113891 ⋅7365311.
It is a Smith number, since the sum of its digits (49) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 101536248791 and 101536248800.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25384062208 + ... + 25384062211.
It is an arithmetic number, because the mean of its divisors is an integer number (38076093315).
Almost surely, 2101536248838 is an apocalyptic number.
101536248838 is a deficient number, since it is larger than the sum of its proper divisors (50768124422).
101536248838 is an equidigital number, since it uses as much as digits as its factorization.
101536248838 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50768124421.
The product of its (nonzero) digits is 1105920, while the sum is 49.
The spelling of 101536248838 in words is "one hundred one billion, five hundred thirty-six million, two hundred forty-eight thousand, eight hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •