Base | Representation |
---|---|
bin | 10110111111010110000001… |
… | …110000001110111101100000 |
3 | 111021000000120212221120022202 |
4 | 112333112001300032331200 |
5 | 101223041241004121232 |
6 | 555013143234152332 |
7 | 30203646051504434 |
oct | 2677260160167540 |
9 | 437000525846282 |
10 | 101110002020192 |
11 | 2a242569231a60 |
12 | b40b9671226a8 |
13 | 445582b168059 |
14 | 1ad7a708069c4 |
15 | ba51833cc162 |
hex | 5bf581c0ef60 |
101110002020192 has 96 divisors (see below), whose sum is σ = 220044766354560. Its totient is φ = 45349231928320.
The previous prime is 101110002020189. The next prime is 101110002020227. The reversal of 101110002020192 is 291020200011101.
It is a congruent number.
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, 21496823 + ... + 25774665.
It is an arithmetic number, because the mean of its divisors is an integer number (2292132982860).
Almost surely, 2101110002020192 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101110002020192, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (110022383177280).
101110002020192 is an abundant number, since it is smaller than the sum of its proper divisors (118934764334368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101110002020192 is a wasteful number, since it uses less digits than its factorization.
101110002020192 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4278756 (or 4278748 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 20.
Adding to 101110002020192 its reverse (291020200011101), we get a palindrome (392130202031293).
The spelling of 101110002020192 in words is "one hundred one trillion, one hundred ten billion, two million, twenty thousand, one hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •