Base | Representation |
---|---|
bin | 11101011100000100101… |
… | …10000101010100111111 |
3 | 10120200212110111101000201 |
4 | 32232002112011110333 |
5 | 113033030030013011 |
6 | 2052402324104331 |
7 | 133036005225364 |
oct | 16560226052477 |
9 | 3520773441021 |
10 | 1011504141631 |
11 | 35aa81799865 |
12 | 1440528350a7 |
13 | 744cc798439 |
14 | 36d5826a46b |
15 | 1b4a16dacc1 |
hex | eb8258553f |
1011504141631 has 2 divisors, whose sum is σ = 1011504141632. Its totient is φ = 1011504141630.
The previous prime is 1011504141589. The next prime is 1011504141667. The reversal of 1011504141631 is 1361414051101.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1011504141631 is a prime.
It is a super-2 number, since 2×10115041416312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1011504141631.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1011504141671) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505752070815 + 505752070816.
It is an arithmetic number, because the mean of its divisors is an integer number (505752070816).
Almost surely, 21011504141631 is an apocalyptic number.
1011504141631 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011504141631 is an equidigital number, since it uses as much as digits as its factorization.
1011504141631 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 28.
Adding to 1011504141631 its reverse (1361414051101), we get a palindrome (2372918192732).
The spelling of 1011504141631 in words is "one trillion, eleven billion, five hundred four million, one hundred forty-one thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •