Base | Representation |
---|---|
bin | 11001000010011101010000… |
… | …000101011111111100110011 |
3 | 112102220100222211202121000210 |
4 | 121002131100011133330303 |
5 | 103413201240042333021 |
6 | 1030112233445115203 |
7 | 32123623335644352 |
oct | 3102352005377463 |
9 | 472810884677023 |
10 | 110120010121011 |
11 | 320a66a7988390 |
12 | 10425bb46b8b03 |
13 | 495a3705c0497 |
14 | 1d29ba075d999 |
15 | cae71a516e76 |
hex | 64275015ff33 |
110120010121011 has 64 divisors (see below), whose sum is σ = 171156423144960. Its totient is φ = 62276428800000.
The previous prime is 110120010121001. The next prime is 110120010121027. The reversal of 110120010121011 is 110121010021011.
It is not a de Polignac number, because 110120010121011 - 215 = 110120010088243 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110120010121001) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 7717161 + ... + 16727061.
It is an arithmetic number, because the mean of its divisors is an integer number (2674319111640).
Almost surely, 2110120010121011 is an apocalyptic number.
110120010121011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
110120010121011 is a deficient number, since it is larger than the sum of its proper divisors (61036413023949).
110120010121011 is a wasteful number, since it uses less digits than its factorization.
110120010121011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9010228.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 110120010121011 its reverse (110121010021011), we get a palindrome (220241020142022).
It can be divided in two parts, 1101200 and 10121011, that added together give a palindrome (11222211).
The spelling of 110120010121011 in words is "one hundred ten trillion, one hundred twenty billion, ten million, one hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •