Base | Representation |
---|---|
bin | 101111000100010100… |
… | …1010010110010110000 |
3 | 100122220012210010120121 |
4 | 1132020221102302300 |
5 | 3124001123232224 |
6 | 114233430020024 |
7 | 10205530255330 |
oct | 1361051226260 |
9 | 318805703517 |
10 | 101076774064 |
11 | 39959227422 |
12 | 1770a4a7614 |
13 | 96ba91a866 |
14 | 4c6c0750c0 |
15 | 2968a33be4 |
hex | 1788a52cb0 |
101076774064 has 80 divisors (see below), whose sum is σ = 238708703808. Its totient is φ = 40472764416.
The previous prime is 101076774053. The next prime is 101076774077. The reversal of 101076774064 is 460477670101.
101076774064 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 101076774064.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 67102 + ... + 454594.
Almost surely, 2101076774064 is an apocalyptic number.
101076774064 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101076774064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (119354351904).
101076774064 is an abundant number, since it is smaller than the sum of its proper divisors (137631929744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101076774064 is a wasteful number, since it uses less digits than its factorization.
101076774064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 387662 (or 387656 counting only the distinct ones).
The product of its (nonzero) digits is 197568, while the sum is 43.
The spelling of 101076774064 in words is "one hundred one billion, seventy-six million, seven hundred seventy-four thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •