Base | Representation |
---|---|
bin | 1001011001000100… |
… | …10000100010010111 |
3 | 111000101200112020002 |
4 | 10230202100202113 |
5 | 40311242123211 |
6 | 2152154401515 |
7 | 235643346311 |
oct | 45442204227 |
9 | 14011615202 |
10 | 5042145431 |
11 | 2158183544 |
12 | b8873029b |
13 | 6247c6b0b |
14 | 35b9127b1 |
15 | 1e79ce03b |
hex | 12c890897 |
5042145431 has 2 divisors, whose sum is σ = 5042145432. Its totient is φ = 5042145430.
The previous prime is 5042145421. The next prime is 5042145467. The reversal of 5042145431 is 1345412405.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5042145431 is a prime.
It is a super-2 number, since 2×50421454312 = 50846461094708351522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5042145394 and 5042145403.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5042145401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2521072715 + 2521072716.
It is an arithmetic number, because the mean of its divisors is an integer number (2521072716).
Almost surely, 25042145431 is an apocalyptic number.
5042145431 is a deficient number, since it is larger than the sum of its proper divisors (1).
5042145431 is an equidigital number, since it uses as much as digits as its factorization.
5042145431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9600, while the sum is 29.
The square root of 5042145431 is about 71008.0659573263. The cubic root of 5042145431 is about 1714.7670218756.
Adding to 5042145431 its reverse (1345412405), we get a palindrome (6387557836).
The spelling of 5042145431 in words is "five billion, forty-two million, one hundred forty-five thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •