Base | Representation |
---|---|
bin | 11011111111101111… |
… | …11001110100011101 |
3 | 1102210111002110210222 |
4 | 31333313321310131 |
5 | 221240221404234 |
6 | 10523234411125 |
7 | 1041315061643 |
oct | 157767716435 |
9 | 42714073728 |
10 | 15030263069 |
11 | 6413212118 |
12 | 2ab5730aa5 |
13 | 1556bb39b3 |
14 | a28261193 |
15 | 5ce7e142e |
hex | 37fdf9d1d |
15030263069 has 2 divisors, whose sum is σ = 15030263070. Its totient is φ = 15030263068.
The previous prime is 15030263047. The next prime is 15030263113. The reversal of 15030263069 is 96036203051.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14295310969 + 734952100 = 119563^2 + 27110^2 .
It is a cyclic number.
It is not a de Polignac number, because 15030263069 - 28 = 15030262813 is a prime.
It is a super-2 number, since 2×150302630692 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (15030263569) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7515131534 + 7515131535.
It is an arithmetic number, because the mean of its divisors is an integer number (7515131535).
Almost surely, 215030263069 is an apocalyptic number.
It is an amenable number.
15030263069 is a deficient number, since it is larger than the sum of its proper divisors (1).
15030263069 is an equidigital number, since it uses as much as digits as its factorization.
15030263069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 29160, while the sum is 35.
The spelling of 15030263069 in words is "fifteen billion, thirty million, two hundred sixty-three thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.470 sec. • engine limits •