Base | Representation |
---|---|
bin | 11001000010011110001011… |
… | …101111101000000011001010 |
3 | 112102220110120121010112021220 |
4 | 121002132023233220003022 |
5 | 103413210312310114403 |
6 | 1030112521041542510 |
7 | 32123660211311220 |
oct | 3102361357500312 |
9 | 472813517115256 |
10 | 110121011019978 |
11 | 320a7070965612 |
12 | 10426233944a36 |
13 | 495a49ca838aa |
14 | 1d29c57662b10 |
15 | cae778324953 |
hex | 64278bbe80ca |
110121011019978 has 32 divisors (see below), whose sum is σ = 264952808471040. Its totient is φ = 29807190952560.
The previous prime is 110121011019973. The next prime is 110121011019983. The reversal of 110121011019978 is 879910110121011.
It is an interprime number because it is at equal distance from previous prime (110121011019973) and next prime (110121011019983).
It is a super-2 number, since 2×1101210110199782 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is not an unprimeable number, because it can be changed into a prime (110121011019973) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 68998126408 + ... + 68998128003.
It is an arithmetic number, because the mean of its divisors is an integer number (8279775264720).
Almost surely, 2110121011019978 is an apocalyptic number.
110121011019978 is an abundant number, since it is smaller than the sum of its proper divisors (154831797451062).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110121011019978 is a wasteful number, since it uses less digits than its factorization.
110121011019978 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 137996254442.
The product of its (nonzero) digits is 9072, while the sum is 42.
The spelling of 110121011019978 in words is "one hundred ten trillion, one hundred twenty-one billion, eleven million, nineteen thousand, nine hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •