Base | Representation |
---|---|
bin | 10010001011001… |
… | …10001100110011 |
3 | 101121212212201121 |
4 | 21011212030303 |
5 | 303012242011 |
6 | 23043443111 |
7 | 3530623003 |
oct | 1105461463 |
9 | 347785647 |
10 | 152462131 |
11 | 79074068 |
12 | 43086497 |
13 | 257817a3 |
14 | 1636a003 |
15 | d5b8e71 |
hex | 9166333 |
152462131 has 2 divisors, whose sum is σ = 152462132. Its totient is φ = 152462130.
The previous prime is 152462117. The next prime is 152462159. The reversal of 152462131 is 131264251.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 152462131 - 217 = 152331059 is a prime.
It is a super-2 number, since 2×1524621312 = 46489402778122322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 152462096 and 152462105.
It is not a weakly prime, because it can be changed into another prime (152462111) 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, 76231065 + 76231066.
It is an arithmetic number, because the mean of its divisors is an integer number (76231066).
Almost surely, 2152462131 is an apocalyptic number.
152462131 is a deficient number, since it is larger than the sum of its proper divisors (1).
152462131 is an equidigital number, since it uses as much as digits as its factorization.
152462131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1440, while the sum is 25.
The square root of 152462131 is about 12347.5556690383. Note that the first 3 decimals coincide. The cubic root of 152462131 is about 534.2206382961.
The spelling of 152462131 in words is "one hundred fifty-two million, four hundred sixty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •