Base | Representation |
---|---|
bin | 10000011100100110001… |
… | …011000101011111001101 |
3 | 11000001021202101020110021 |
4 | 100130212023011133031 |
5 | 122004141002322432 |
6 | 2223114153142141 |
7 | 144440553423262 |
oct | 20344613053715 |
9 | 4001252336407 |
10 | 1130216839117 |
11 | 3a635aa39503 |
12 | 1630633ba951 |
13 | 8276b072132 |
14 | 3c9ba639269 |
15 | 1e5ed65d697 |
hex | 107262c57cd |
1130216839117 has 2 divisors, whose sum is σ = 1130216839118. Its totient is φ = 1130216839116.
The previous prime is 1130216839111. The next prime is 1130216839123. The reversal of 1130216839117 is 7119386120311.
It is a balanced prime because it is at equal distance from previous prime (1130216839111) and next prime (1130216839123).
It can be written as a sum of positive squares in only one way, i.e., 1002363394761 + 127853444356 = 1001181^2 + 357566^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1130216839117 is a prime.
It is a super-2 number, since 2×11302168391172 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1130216839111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 565108419558 + 565108419559.
It is an arithmetic number, because the mean of its divisors is an integer number (565108419559).
Almost surely, 21130216839117 is an apocalyptic number.
It is an amenable number.
1130216839117 is a deficient number, since it is larger than the sum of its proper divisors (1).
1130216839117 is an equidigital number, since it uses as much as digits as its factorization.
1130216839117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 54432, while the sum is 43.
The spelling of 1130216839117 in words is "one trillion, one hundred thirty billion, two hundred sixteen million, eight hundred thirty-nine thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •