Base | Representation |
---|---|
bin | 10000001111011010010… |
… | …111111000001001110001 |
3 | 10221200202011012120200012 |
4 | 100033122113320021301 |
5 | 121241142404101230 |
6 | 2212413323504305 |
7 | 143430004235255 |
oct | 20173227701161 |
9 | 3850664176605 |
10 | 1116060222065 |
11 | 3a0355999598 |
12 | 160372388095 |
13 | 81323188559 |
14 | 3c036434265 |
15 | 1e0708e0395 |
hex | 103da5f8271 |
1116060222065 has 8 divisors (see below), whose sum is σ = 1339443117288. Its totient is φ = 892734277120.
The previous prime is 1116060222041. The next prime is 1116060222097. The reversal of 1116060222065 is 5602220606111.
It can be written as a sum of positive squares in 4 ways, for example, as 92329076449 + 1023731145616 = 303857^2 + 1011796^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1116060222065 - 222 = 1116056027761 is a prime.
It is a super-2 number, since 2×11160602220652 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14194442 + ... + 14272851.
It is an arithmetic number, because the mean of its divisors is an integer number (167430389661).
Almost surely, 21116060222065 is an apocalyptic number.
It is an amenable number.
1116060222065 is a deficient number, since it is larger than the sum of its proper divisors (223382895223).
1116060222065 is an equidigital number, since it uses as much as digits as its factorization.
1116060222065 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28475139.
The product of its (nonzero) digits is 8640, while the sum is 32.
Adding to 1116060222065 its reverse (5602220606111), we get a palindrome (6718280828176).
The spelling of 1116060222065 in words is "one trillion, one hundred sixteen billion, sixty million, two hundred twenty-two thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •