Base | Representation |
---|---|
bin | 101111010101100111… |
… | …0001000110011000000 |
3 | 100201101122022102212010 |
4 | 1132223032020303000 |
5 | 3131143123422132 |
6 | 114411151132520 |
7 | 10226103014460 |
oct | 1365316106300 |
9 | 321348272763 |
10 | 101656857792 |
11 | 3a126711966 |
12 | 17850814140 |
13 | 9780b62179 |
14 | 4cc5115ba0 |
15 | 299e91a6cc |
hex | 17ab388cc0 |
101656857792 has 56 divisors (see below), whose sum is σ = 307390978816. Its totient is φ = 29044816128.
The previous prime is 101656857697. The next prime is 101656857829. The reversal of 101656857792 is 297758656101.
101656857792 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (56).
It is a super-2 number, since 2×1016568577922 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37817428 + ... + 37820115.
Almost surely, 2101656857792 is an apocalyptic number.
101656857792 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101656857792 is an abundant number, since it is smaller than the sum of its proper divisors (205734121024).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101656857792 is an equidigital number, since it uses as much as digits as its factorization.
101656857792 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75637565 (or 75637555 counting only the distinct ones).
The product of its (nonzero) digits is 6350400, while the sum is 57.
The spelling of 101656857792 in words is "one hundred one billion, six hundred fifty-six million, eight hundred fifty-seven thousand, seven hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •