Base | Representation |
---|---|
bin | 11101001000100010001… |
… | …11010100011000100001 |
3 | 10112200210102101221010121 |
4 | 32210101013110120201 |
5 | 112400034203324022 |
6 | 2043505411000241 |
7 | 132215033645314 |
oct | 16442107243041 |
9 | 3480712357117 |
10 | 1001014511137 |
11 | 356589660153 |
12 | 142005899081 |
13 | 7351a5169a4 |
14 | 3664109097b |
15 | 1b08a8622c7 |
hex | e9111d4621 |
1001014511137 has 2 divisors, whose sum is σ = 1001014511138. Its totient is φ = 1001014511136.
The previous prime is 1001014511117. The next prime is 1001014511153. The reversal of 1001014511137 is 7311154101001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 572134908816 + 428879602321 = 756396^2 + 654889^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1001014511137 is a prime.
It is a super-3 number, since 3×10010145111373 (a number of 37 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (1001014511117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500507255568 + 500507255569.
It is an arithmetic number, because the mean of its divisors is an integer number (500507255569).
Almost surely, 21001014511137 is an apocalyptic number.
It is an amenable number.
1001014511137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1001014511137 is an equidigital number, since it uses as much as digits as its factorization.
1001014511137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 420, while the sum is 25.
Adding to 1001014511137 its reverse (7311154101001), we get a palindrome (8312168612138).
It can be divided in two parts, 1001014 and 511137, that added together give a palindrome (1512151).
The spelling of 1001014511137 in words is "one trillion, one billion, fourteen million, five hundred eleven thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •