Base | Representation |
---|---|
bin | 1001001100100010011011… |
… | …1010111100001111111000 |
3 | 1022210121021101121022221011 |
4 | 2103020212322330033320 |
5 | 2311124320014000440 |
6 | 33300533152523304 |
7 | 2062332103645564 |
oct | 223104672741770 |
9 | 38717241538834 |
10 | 10111006000120 |
11 | 3249065325993 |
12 | 11736b7550534 |
13 | 584604bb366c |
14 | 26d537b826a4 |
15 | 1280255049ea |
hex | 93226ebc3f8 |
10111006000120 has 16 divisors (see below), whose sum is σ = 22749763500360. Its totient is φ = 4044402400032.
The previous prime is 10111006000097. The next prime is 10111006000177. The reversal of 10111006000120 is 2100060011101.
It is a self number, because there is not a number n which added to its sum of digits gives 10111006000120.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 126387574962 + ... + 126387575041.
Almost surely, 210111006000120 is an apocalyptic number.
10111006000120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10111006000120 is an abundant number, since it is smaller than the sum of its proper divisors (12638757500240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10111006000120 is a wasteful number, since it uses less digits than its factorization.
10111006000120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 252775150014 (or 252775150010 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 10111006000120 its reverse (2100060011101), we get a palindrome (12211066011221).
The spelling of 10111006000120 in words is "ten trillion, one hundred eleven billion, six million, one hundred twenty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •