Base | Representation |
---|---|
bin | 1101110110101000110010… |
… | …1011100001111100010001 |
3 | 1222221012021011121012111212 |
4 | 3131222030223201330101 |
5 | 3444031234422044243 |
6 | 52221343434145505 |
7 | 3131332642566011 |
oct | 335521453417421 |
9 | 58835234535455 |
10 | 15232314253073 |
11 | 4942a96321355 |
12 | 186015b282295 |
13 | 86652a1c9558 |
14 | 3a93684ddc41 |
15 | 1b636299c318 |
hex | dda8cae1f11 |
15232314253073 has 2 divisors, whose sum is σ = 15232314253074. Its totient is φ = 15232314253072.
The previous prime is 15232314253003. The next prime is 15232314253129. The reversal of 15232314253073 is 37035241323251.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10938848456449 + 4293465796624 = 3307393^2 + 2072068^2 .
It is a cyclic number.
It is not a de Polignac number, because 15232314253073 - 28 = 15232314252817 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 15232314253073.
It is not a weakly prime, because it can be changed into another prime (15232314253003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7616157126536 + 7616157126537.
It is an arithmetic number, because the mean of its divisors is an integer number (7616157126537).
Almost surely, 215232314253073 is an apocalyptic number.
It is an amenable number.
15232314253073 is a deficient number, since it is larger than the sum of its proper divisors (1).
15232314253073 is an equidigital number, since it uses as much as digits as its factorization.
15232314253073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 453600, while the sum is 41.
The spelling of 15232314253073 in words is "fifteen trillion, two hundred thirty-two billion, three hundred fourteen million, two hundred fifty-three thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •