Base | Representation |
---|---|
bin | 11110101001100111000… |
… | …01011001110100001111 |
3 | 10201200022112111021201011 |
4 | 33110303201121310033 |
5 | 114223303113211111 |
6 | 2123445112230051 |
7 | 136041402022321 |
oct | 17246341316417 |
9 | 3650275437634 |
10 | 1053131382031 |
11 | 3766a3234683 |
12 | 15012b69b327 |
13 | 78404a00631 |
14 | 38d869bd611 |
15 | 1c5daea3021 |
hex | f533859d0f |
1053131382031 has 2 divisors, whose sum is σ = 1053131382032. Its totient is φ = 1053131382030.
The previous prime is 1053131382001. The next prime is 1053131382071. The reversal of 1053131382031 is 1302831313501.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (1302831313501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1053131382031 - 25 = 1053131381999 is a prime.
It is a super-2 number, since 2×10531313820312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1053131381984 and 1053131382002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1053131382001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 526565691015 + 526565691016.
It is an arithmetic number, because the mean of its divisors is an integer number (526565691016).
Almost surely, 21053131382031 is an apocalyptic number.
1053131382031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1053131382031 is an equidigital number, since it uses as much as digits as its factorization.
1053131382031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6480, while the sum is 31.
Adding to 1053131382031 its reverse (1302831313501), we get a palindrome (2355962695532).
The spelling of 1053131382031 in words is "one trillion, fifty-three billion, one hundred thirty-one million, three hundred eighty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •