Base | Representation |
---|---|
bin | 11001000000101110100001… |
… | …001001010110110000001000 |
3 | 112102111000002120002112111202 |
4 | 121000232201021112300020 |
5 | 103404224233404031440 |
6 | 1025541451320243332 |
7 | 32112214035055022 |
oct | 3100564111266010 |
9 | 472430076075452 |
10 | 110001111002120 |
11 | 3206023348a568 |
12 | 10406b51610548 |
13 | 494c0a2504b70 |
14 | 1d24121705012 |
15 | cab5ac01d615 |
hex | 640ba1256c08 |
110001111002120 has 64 divisors (see below), whose sum is σ = 282220044991920. Its totient is φ = 38226630426624.
The previous prime is 110001111002113. The next prime is 110001111002147. The reversal of 110001111002120 is 21200111100011.
It can be written as a sum of positive squares in 8 ways, for example, as 42265939503076 + 67735171499044 = 6501226^2 + 8230138^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6221773457 + ... + 6221791136.
Almost surely, 2110001111002120 is an apocalyptic number.
110001111002120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110001111002120 is an abundant number, since it is smaller than the sum of its proper divisors (172218933989800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110001111002120 is a wasteful number, since it uses less digits than its factorization.
110001111002120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12443564634 (or 12443564630 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 110001111002120 its reverse (21200111100011), we get a palindrome (131201222102131).
The spelling of 110001111002120 in words is "one hundred ten trillion, one billion, one hundred eleven million, two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •