Base | Representation |
---|---|
bin | 101111000101000010… |
… | …1111011000001001110 |
3 | 100122221220110210020110 |
4 | 1132022011323001032 |
5 | 3124023332243303 |
6 | 114240054300450 |
7 | 10206243540351 |
oct | 1361205730116 |
9 | 318856423213 |
10 | 101101056078 |
11 | 39970a01900 |
12 | 17716657726 |
13 | 96c2970009 |
14 | 4c71396298 |
15 | 296ac2d703 |
hex | 178a17b04e |
101101056078 has 48 divisors (see below), whose sum is σ = 222444351360. Its totient is φ = 30610612560.
The previous prime is 101101056041. The next prime is 101101056083. The reversal of 101101056078 is 870650101101.
101101056078 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 803103 + ... + 920421.
It is an arithmetic number, because the mean of its divisors is an integer number (4634257320).
Almost surely, 2101101056078 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101101056078, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (111222175680).
101101056078 is an abundant number, since it is smaller than the sum of its proper divisors (121343295282).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101101056078 is a wasteful number, since it uses less digits than its factorization.
101101056078 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 118533 (or 118522 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 30.
Adding to 101101056078 its reverse (870650101101), we get a palindrome (971751157179).
The spelling of 101101056078 in words is "one hundred one billion, one hundred one million, fifty-six thousand, seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •