Base | Representation |
---|---|
bin | 10010000000010… |
… | …01110010001111 |
3 | 101112012101002202 |
4 | 21000021302033 |
5 | 302131110043 |
6 | 22553112115 |
7 | 3512530226 |
oct | 1100116217 |
9 | 345171082 |
10 | 151035023 |
11 | 78289937 |
12 | 426b863b |
13 | 253a2049 |
14 | 160b7cbd |
15 | d3d61b8 |
hex | 9009c8f |
151035023 has 2 divisors, whose sum is σ = 151035024. Its totient is φ = 151035022.
The previous prime is 151035019. The next prime is 151035041. The reversal of 151035023 is 320530151.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 151035023 - 22 = 151035019 is a prime.
It is a super-2 number, since 2×1510350232 = 45623156345221058, which 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 = 151034986 and 151035004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (151035223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75517511 + 75517512.
It is an arithmetic number, because the mean of its divisors is an integer number (75517512).
Almost surely, 2151035023 is an apocalyptic number.
151035023 is a deficient number, since it is larger than the sum of its proper divisors (1).
151035023 is an equidigital number, since it uses as much as digits as its factorization.
151035023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 450, while the sum is 20.
The square root of 151035023 is about 12289.6307104811. The cubic root of 151035023 is about 532.5485689717.
Adding to 151035023 its reverse (320530151), we get a palindrome (471565174).
The spelling of 151035023 in words is "one hundred fifty-one million, thirty-five thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •