Base | Representation |
---|---|
bin | 11100100100100110… |
… | …11100100100101101 |
3 | 1110121000220222100221 |
4 | 32102103130210231 |
5 | 222403401120242 |
6 | 11014042051341 |
7 | 1052061241126 |
oct | 162223344455 |
9 | 43530828327 |
10 | 15339473197 |
11 | 6561807284 |
12 | 2b811a9b51 |
13 | 15a5c87979 |
14 | a5735104d |
15 | 5eba1e167 |
hex | 3924dc92d |
15339473197 has 2 divisors, whose sum is σ = 15339473198. Its totient is φ = 15339473196.
The previous prime is 15339473101. The next prime is 15339473239. The reversal of 15339473197 is 79137493351.
15339473197 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8322730441 + 7016742756 = 91229^2 + 83766^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-15339473197 is a prime.
It is a super-2 number, since 2×153394731972 (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 (15339473497) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7669736598 + 7669736599.
It is an arithmetic number, because the mean of its divisors is an integer number (7669736599).
Almost surely, 215339473197 is an apocalyptic number.
It is an amenable number.
15339473197 is a deficient number, since it is larger than the sum of its proper divisors (1).
15339473197 is an equidigital number, since it uses as much as digits as its factorization.
15339473197 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2143260, while the sum is 52.
The spelling of 15339473197 in words is "fifteen billion, three hundred thirty-nine million, four hundred seventy-three thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •