Base | Representation |
---|---|
bin | 10000001001111001100… |
… | …100010011011010110001 |
3 | 10221010110122101011011012 |
4 | 100021321210103122301 |
5 | 121142032111402400 |
6 | 2205554121000305 |
7 | 143130221562362 |
oct | 20117144233261 |
9 | 3833418334135 |
10 | 1110141122225 |
11 | 3988987a4243 |
12 | 15b1a0023095 |
13 | 808bbaa6805 |
14 | 3ba34283b69 |
15 | 1dd25e37d35 |
hex | 102799136b1 |
1110141122225 has 18 divisors (see below), whose sum is σ = 1389560772054. Its totient is φ = 879812550400.
The previous prime is 1110141122203. The next prime is 1110141122257. The reversal of 1110141122225 is 5222211410111.
It can be written as a sum of positive squares in 3 ways, for example, as 378137675041 + 732003447184 = 614929^2 + 855572^2 .
It is not a de Polignac number, because 1110141122225 - 214 = 1110141105841 is a prime.
It is a super-2 number, since 2×11101411222252 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1110141122225.
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 1653056 + ... + 2225505.
Almost surely, 21110141122225 is an apocalyptic number.
It is an amenable number.
1110141122225 is a deficient number, since it is larger than the sum of its proper divisors (279419649829).
1110141122225 is an equidigital number, since it uses as much as digits as its factorization.
1110141122225 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3878785 (or 3878673 counting only the distinct ones).
The product of its (nonzero) digits is 320, while the sum is 23.
Adding to 1110141122225 its reverse (5222211410111), we get a palindrome (6332352532336).
The spelling of 1110141122225 in words is "one trillion, one hundred ten billion, one hundred forty-one million, one hundred twenty-two thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •