Base | Representation |
---|---|
bin | 11101011100111010101… |
… | …00100001011000111001 |
3 | 10120202001000002120212121 |
4 | 32232131110201120321 |
5 | 113034441404421423 |
6 | 2052515252241241 |
7 | 133053142112416 |
oct | 16563524413071 |
9 | 3522030076777 |
10 | 1011956717113 |
11 | 360194204491 |
12 | 14415a310221 |
13 | 74572487494 |
14 | 36d9c3d910d |
15 | 1b4cb2d745d |
hex | eb9d521639 |
1011956717113 has 2 divisors, whose sum is σ = 1011956717114. Its totient is φ = 1011956717112.
The previous prime is 1011956717071. The next prime is 1011956717143. The reversal of 1011956717113 is 3117176591101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 988360070569 + 23596646544 = 994163^2 + 153612^2 .
It is a cyclic number.
It is not a de Polignac number, because 1011956717113 - 221 = 1011954619961 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1011956717113.
It is not a weakly prime, because it can be changed into another prime (1011956717143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505978358556 + 505978358557.
It is an arithmetic number, because the mean of its divisors is an integer number (505978358557).
Almost surely, 21011956717113 is an apocalyptic number.
It is an amenable number.
1011956717113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011956717113 is an equidigital number, since it uses as much as digits as its factorization.
1011956717113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 39690, while the sum is 43.
The spelling of 1011956717113 in words is "one trillion, eleven billion, nine hundred fifty-six million, seven hundred seventeen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •