Base | Representation |
---|---|
bin | 1110000010011000101000… |
… | …0101010001010100111111 |
3 | 2000122111012100022022121122 |
4 | 3200212022011101110333 |
5 | 4010333101314211111 |
6 | 52454202054421155 |
7 | 3152036142343406 |
oct | 340461205212477 |
9 | 60574170268548 |
10 | 15434134132031 |
11 | 4a1064139454a |
12 | 18932a43617bb |
13 | 87c581578a84 |
14 | 3b503219063d |
15 | 1bb725aa4cdb |
hex | e098a15153f |
15434134132031 has 2 divisors, whose sum is σ = 15434134132032. Its totient is φ = 15434134132030.
The previous prime is 15434134131989. The next prime is 15434134132057. The reversal of 15434134132031 is 13023143143451.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 15434134132031 - 26 = 15434134131967 is a prime.
It is a super-2 number, since 2×154341341320312 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 15434134131982 and 15434134132000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (15434134132091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7717067066015 + 7717067066016.
It is an arithmetic number, because the mean of its divisors is an integer number (7717067066016).
Almost surely, 215434134132031 is an apocalyptic number.
15434134132031 is a deficient number, since it is larger than the sum of its proper divisors (1).
15434134132031 is an equidigital number, since it uses as much as digits as its factorization.
15434134132031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 51840, while the sum is 35.
Adding to 15434134132031 its reverse (13023143143451), we get a palindrome (28457277275482).
The spelling of 15434134132031 in words is "fifteen trillion, four hundred thirty-four billion, one hundred thirty-four million, one hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •