Base | Representation |
---|---|
bin | 101111001101110110… |
… | …1101100011011100000 |
3 | 100200201111202210020222 |
4 | 1132123231230123200 |
5 | 3130130023213002 |
6 | 114325255022212 |
7 | 10216463453603 |
oct | 1363355543340 |
9 | 320644683228 |
10 | 101396694752 |
11 | 3a002877591 |
12 | 1779966a968 |
13 | 973bca1942 |
14 | 4c9c75233a |
15 | 2986b7a1a2 |
hex | 179bb6c6e0 |
101396694752 has 48 divisors (see below), whose sum is σ = 215355499632. Its totient is φ = 46815774720.
The previous prime is 101396694739. The next prime is 101396694757. The reversal of 101396694752 is 257496693101.
It is a Harshad number since it is a multiple of its sum of digits (53).
It is a junction number, because it is equal to n+sod(n) for n = 101396694694 and 101396694703.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101396694757) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1729574 + ... + 1787237.
It is an arithmetic number, because the mean of its divisors is an integer number (4486572909).
Almost surely, 2101396694752 is an apocalyptic number.
It is an amenable number.
101396694752 is an abundant number, since it is smaller than the sum of its proper divisors (113958804880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101396694752 is a wasteful number, since it uses less digits than its factorization.
101396694752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3516891 (or 3516883 counting only the distinct ones).
The product of its (nonzero) digits is 2449440, while the sum is 53.
The spelling of 101396694752 in words is "one hundred one billion, three hundred ninety-six million, six hundred ninety-four thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •