Base | Representation |
---|---|
bin | 1101110101100010010111… |
… | …0101101001000001010001 |
3 | 1222212101110121222212202121 |
4 | 3131120211311221001101 |
5 | 3443224030144343243 |
6 | 52204535452414241 |
7 | 3130063312456642 |
oct | 335304565510121 |
9 | 58771417885677 |
10 | 15213408981073 |
11 | 4935a74836716 |
12 | 1858563a77381 |
13 | 864806577a84 |
14 | 3a84937836c9 |
15 | 1b5b07dc51ed |
hex | dd625d69051 |
15213408981073 has 2 divisors, whose sum is σ = 15213408981074. Its totient is φ = 15213408981072.
The previous prime is 15213408980849. The next prime is 15213408981103. The reversal of 15213408981073 is 37018980431251.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13971238547344 + 1242170433729 = 3737812^2 + 1114527^2 .
It is a cyclic number.
It is not a de Polignac number, because 15213408981073 - 217 = 15213408850001 is a prime.
It is a super-3 number, since 3×152134089810733 (a number of 41 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 15213408981073.
It is not a weakly prime, because it can be changed into another prime (15213408931073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7606704490536 + 7606704490537.
It is an arithmetic number, because the mean of its divisors is an integer number (7606704490537).
Almost surely, 215213408981073 is an apocalyptic number.
It is an amenable number.
15213408981073 is a deficient number, since it is larger than the sum of its proper divisors (1).
15213408981073 is an equidigital number, since it uses as much as digits as its factorization.
15213408981073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1451520, while the sum is 52.
The spelling of 15213408981073 in words is "fifteen trillion, two hundred thirteen billion, four hundred eight million, nine hundred eighty-one thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •