Base | Representation |
---|---|
bin | 11001000010011110010010… |
… | …001111101110111010000001 |
3 | 112102220110212012101100220120 |
4 | 121002132102033232322001 |
5 | 103413211023221144334 |
6 | 1030112535535530453 |
7 | 32123663004421536 |
oct | 3102362217567201 |
9 | 472813765340816 |
10 | 110121120099969 |
11 | 320a7117498a70 |
12 | 10426264389a29 |
13 | 495a4b9556274 |
14 | 1d29c67d38d8d |
15 | cae782bbe949 |
hex | 6427923eee81 |
110121120099969 has 16 divisors (see below), whose sum is σ = 169598302614720. Its totient is φ = 62814186152960.
The previous prime is 110121120099961. The next prime is 110121120099973. The reversal of 110121120099969 is 969990021121011.
It is not a de Polignac number, because 110121120099969 - 23 = 110121120099961 is a prime.
It is a super-2 number, since 2×1101211200999692 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is not an unprimeable number, because it can be changed into a prime (110121120099961) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 98147165304 + ... + 98147166425.
It is an arithmetic number, because the mean of its divisors is an integer number (10599893913420).
Almost surely, 2110121120099969 is an apocalyptic number.
It is an amenable number.
110121120099969 is a deficient number, since it is larger than the sum of its proper divisors (59477182514751).
110121120099969 is a wasteful number, since it uses less digits than its factorization.
110121120099969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 196294331760.
The product of its (nonzero) digits is 157464, while the sum is 51.
The spelling of 110121120099969 in words is "one hundred ten trillion, one hundred twenty-one billion, one hundred twenty million, ninety-nine thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •