Base | Representation |
---|---|
bin | 11100001110111101… |
… | …11110010000110001 |
3 | 1110010101100102000221 |
4 | 32013132332100301 |
5 | 222020413223033 |
6 | 10544035213041 |
7 | 1044425260423 |
oct | 160736762061 |
9 | 43111312027 |
10 | 15157945393 |
11 | 64792a07a8 |
12 | 2b30447181 |
13 | 157749a576 |
14 | a3b1ba813 |
15 | 5dab1312d |
hex | 3877be431 |
15157945393 has 2 divisors, whose sum is σ = 15157945394. Its totient is φ = 15157945392.
The previous prime is 15157945391. The next prime is 15157945469. The reversal of 15157945393 is 39354975151.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8372799009 + 6785146384 = 91503^2 + 82372^2 .
It is an emirp because it is prime and its reverse (39354975151) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 15157945393 - 21 = 15157945391 is a prime.
Together with 15157945391, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 15157945393.
It is not a weakly prime, because it can be changed into another prime (15157945391) 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, 7578972696 + 7578972697.
It is an arithmetic number, because the mean of its divisors is an integer number (7578972697).
Almost surely, 215157945393 is an apocalyptic number.
It is an amenable number.
15157945393 is a deficient number, since it is larger than the sum of its proper divisors (1).
15157945393 is an equidigital number, since it uses as much as digits as its factorization.
15157945393 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2551500, while the sum is 52.
The spelling of 15157945393 in words is "fifteen billion, one hundred fifty-seven million, nine hundred forty-five thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •