Base | Representation |
---|---|
bin | 11101001000100111000… |
… | …01110001100010001001 |
3 | 10112200220020121000101112 |
4 | 32210103201301202021 |
5 | 112400130040010323 |
6 | 2043513414500105 |
7 | 132216035052605 |
oct | 16442341614211 |
9 | 3480806530345 |
10 | 1001055000713 |
11 | 3565aa4a5609 |
12 | 142017364635 |
13 | 73525a22311 |
14 | 366465d0505 |
15 | 1b08e1ae178 |
hex | e913871889 |
1001055000713 has 2 divisors, whose sum is σ = 1001055000714. Its totient is φ = 1001055000712.
The previous prime is 1001055000601. The next prime is 1001055000727. The reversal of 1001055000713 is 3170005501001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 608761973824 + 392293026889 = 780232^2 + 626333^2 .
It is an emirp because it is prime and its reverse (3170005501001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1001055000713 - 28 = 1001055000457 is a prime.
It is a super-2 number, since 2×10010550007132 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1001055000773) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500527500356 + 500527500357.
It is an arithmetic number, because the mean of its divisors is an integer number (500527500357).
Almost surely, 21001055000713 is an apocalyptic number.
It is an amenable number.
1001055000713 is a deficient number, since it is larger than the sum of its proper divisors (1).
1001055000713 is an equidigital number, since it uses as much as digits as its factorization.
1001055000713 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 525, while the sum is 23.
The spelling of 1001055000713 in words is "one trillion, one billion, fifty-five million, seven hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •