Base | Representation |
---|---|
bin | 1110010011000010010101… |
… | …00110000100101100111001 |
3 | 11010022200012101012000100111 |
4 | 13021201022212010230321 |
5 | 13110104430444221213 |
6 | 150511305333304321 |
7 | 6423331502263036 |
oct | 711411246045471 |
9 | 133280171160314 |
10 | 31440412101433 |
11 | a021892a88285 |
12 | 36394424950a1 |
13 | 1470a835b617a |
14 | 7a9a1cb9838d |
15 | 397c85bc4a3d |
hex | 1c984a984b39 |
31440412101433 has 2 divisors, whose sum is σ = 31440412101434. Its totient is φ = 31440412101432.
The previous prime is 31440412101353. The next prime is 31440412101491. The reversal of 31440412101433 is 33410121404413.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 30350876960569 + 1089535140864 = 5509163^2 + 1043808^2 .
It is a cyclic number.
It is not a de Polignac number, because 31440412101433 - 221 = 31440410004281 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31440412101395 and 31440412101404.
It is not a weakly prime, because it can be changed into another prime (31440412101493) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15720206050716 + 15720206050717.
It is an arithmetic number, because the mean of its divisors is an integer number (15720206050717).
Almost surely, 231440412101433 is an apocalyptic number.
It is an amenable number.
31440412101433 is a deficient number, since it is larger than the sum of its proper divisors (1).
31440412101433 is an equidigital number, since it uses as much as digits as its factorization.
31440412101433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 31440412101433 its reverse (33410121404413), we get a palindrome (64850533505846).
The spelling of 31440412101433 in words is "thirty-one trillion, four hundred forty billion, four hundred twelve million, one hundred one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •