Base | Representation |
---|---|
bin | 11100010111100100… |
… | …01111001110101001 |
3 | 1110022102010110201001 |
4 | 32023302033032221 |
5 | 222142401320424 |
6 | 10555133555001 |
7 | 1046262515665 |
oct | 161362171651 |
9 | 43272113631 |
10 | 15230104489 |
11 | 6505aa6a16 |
12 | 2b50645a61 |
13 | 1589413a62 |
14 | a46a018a5 |
15 | 5e2118844 |
hex | 38bc8f3a9 |
15230104489 has 2 divisors, whose sum is σ = 15230104490. Its totient is φ = 15230104488.
The previous prime is 15230104481. The next prime is 15230104523. The reversal of 15230104489 is 98440103251.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15229534464 + 570025 = 123408^2 + 755^2 .
It is a cyclic number.
It is not a de Polignac number, because 15230104489 - 23 = 15230104481 is a prime.
It is a super-2 number, since 2×152301044892 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (15230104481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7615052244 + 7615052245.
It is an arithmetic number, because the mean of its divisors is an integer number (7615052245).
Almost surely, 215230104489 is an apocalyptic number.
It is an amenable number.
15230104489 is a deficient number, since it is larger than the sum of its proper divisors (1).
15230104489 is an equidigital number, since it uses as much as digits as its factorization.
15230104489 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34560, while the sum is 37.
The spelling of 15230104489 in words is "fifteen billion, two hundred thirty million, one hundred four thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •