Base | Representation |
---|---|
bin | 101111000101100111… |
… | …0001100100001001000 |
3 | 100200000020010100022201 |
4 | 1132023032030201020 |
5 | 3124043210031440 |
6 | 114242012325544 |
7 | 10206563556544 |
oct | 1361316144110 |
9 | 320006110281 |
10 | 101120002120 |
11 | 39980672295 |
12 | 17720a738b4 |
13 | 96c68747a7 |
14 | 4c73ac8a24 |
15 | 296c72219a |
hex | 178b38c848 |
101120002120 has 32 divisors (see below), whose sum is σ = 227924176320. Its totient is φ = 40376148160.
The previous prime is 101120002013. The next prime is 101120002189. The reversal of 101120002120 is 21200021101.
It is a super-3 number, since 3×1011200021203 (a number of 34 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 101120002097 and 101120002106.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2222596 + ... + 2267635.
It is an arithmetic number, because the mean of its divisors is an integer number (7122630510).
Almost surely, 2101120002120 is an apocalyptic number.
101120002120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101120002120 is an abundant number, since it is smaller than the sum of its proper divisors (126804174200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101120002120 is a wasteful number, since it uses less digits than its factorization.
101120002120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4490805 (or 4490801 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 101120002120 its reverse (21200021101), we get a palindrome (122320023221).
The spelling of 101120002120 in words is "one hundred one billion, one hundred twenty million, two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •