Base | Representation |
---|---|
bin | 1000111000110111001… |
… | …1101101111101101111 |
3 | 112121011010122011101122 |
4 | 2032031303231331233 |
5 | 10000213432003211 |
6 | 154052323131155 |
7 | 14014060041662 |
oct | 2161563557557 |
9 | 477133564348 |
10 | 152703000431 |
11 | 59840954403 |
12 | 25717b13abb |
13 | 115275767b7 |
14 | 75687656d9 |
15 | 3e8b0586db |
hex | 238dcedf6f |
152703000431 has 2 divisors, whose sum is σ = 152703000432. Its totient is φ = 152703000430.
The previous prime is 152703000413. The next prime is 152703000469. The reversal of 152703000431 is 134000307251.
Together with previous prime (152703000413) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 152703000431 - 26 = 152703000367 is a prime.
It is a super-2 number, since 2×1527030004312 (a number of 23 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 152703000431.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (152703000031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76351500215 + 76351500216.
It is an arithmetic number, because the mean of its divisors is an integer number (76351500216).
Almost surely, 2152703000431 is an apocalyptic number.
152703000431 is a deficient number, since it is larger than the sum of its proper divisors (1).
152703000431 is an equidigital number, since it uses as much as digits as its factorization.
152703000431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2520, while the sum is 26.
Adding to 152703000431 its reverse (134000307251), we get a palindrome (286703307682).
The spelling of 152703000431 in words is "one hundred fifty-two billion, seven hundred three million, four hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •