Base | Representation |
---|---|
bin | 111001100100… |
… | …110100100111 |
3 | 1001101210202011 |
4 | 321210310213 |
5 | 12330434111 |
6 | 1255255051 |
7 | 242201002 |
oct | 71446447 |
9 | 31353664 |
10 | 15093031 |
11 | 8579688 |
12 | 507a487 |
13 | 3185ab5 |
14 | 200c539 |
15 | 14d2021 |
hex | e64d27 |
15093031 has 2 divisors, whose sum is σ = 15093032. Its totient is φ = 15093030.
The previous prime is 15093017. The next prime is 15093053. The reversal of 15093031 is 13039051.
It is an a-pointer prime, because the next prime (15093053) can be obtained adding 15093031 to its sum of digits (22).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 15093031 - 25 = 15092999 is a prime.
It is a super-2 number, since 2×150930312 = 455599169533922, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 15092993 and 15093011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (15091031) 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, 7546515 + 7546516.
It is an arithmetic number, because the mean of its divisors is an integer number (7546516).
Almost surely, 215093031 is an apocalyptic number.
15093031 is a deficient number, since it is larger than the sum of its proper divisors (1).
15093031 is an equidigital number, since it uses as much as digits as its factorization.
15093031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 405, while the sum is 22.
The square root of 15093031 is about 3884.9750320948. The cubic root of 15093031 is about 247.1300107243.
The spelling of 15093031 in words is "fifteen million, ninety-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •