Base | Representation |
---|---|
bin | 11101011110111000010… |
… | …10011010100111101111 |
3 | 10120211202110222100202211 |
4 | 32233130022122213233 |
5 | 113044121311020214 |
6 | 2053212034031251 |
7 | 133121233463401 |
oct | 16573412324757 |
9 | 3524673870684 |
10 | 1013011032559 |
11 | 360685356269 |
12 | 1443b3418527 |
13 | 746aca31086 |
14 | 3705c444b71 |
15 | 1b53db470c4 |
hex | ebdc29a9ef |
1013011032559 has 2 divisors, whose sum is σ = 1013011032560. Its totient is φ = 1013011032558.
The previous prime is 1013011032547. The next prime is 1013011032563. The reversal of 1013011032559 is 9552301103101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1013011032559 - 219 = 1013010508271 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1013011032559.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1013011032959) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506505516279 + 506505516280.
It is an arithmetic number, because the mean of its divisors is an integer number (506505516280).
Almost surely, 21013011032559 is an apocalyptic number.
1013011032559 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013011032559 is an equidigital number, since it uses as much as digits as its factorization.
1013011032559 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4050, while the sum is 31.
The spelling of 1013011032559 in words is "one trillion, thirteen billion, eleven million, thirty-two thousand, five hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •