Base | Representation |
---|---|
bin | 11100100001100111… |
… | …00100011101010101 |
3 | 1110112021122001122112 |
4 | 32100303210131111 |
5 | 222330432332134 |
6 | 11011343240405 |
7 | 1051334511416 |
oct | 162063443525 |
9 | 43467561575 |
10 | 15314339669 |
11 | 6549600072 |
12 | 2b748a9105 |
13 | 15a09c7a65 |
14 | a53c8b80d |
15 | 5e97071ce |
hex | 390ce4755 |
15314339669 has 2 divisors, whose sum is σ = 15314339670. Its totient is φ = 15314339668.
The previous prime is 15314339659. The next prime is 15314339681. The reversal of 15314339669 is 96693341351.
15314339669 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14910852100 + 403487569 = 122110^2 + 20087^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-15314339669 is a prime.
It is a super-2 number, since 2×153143396692 (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 (15314339609) 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, 7657169834 + 7657169835.
It is an arithmetic number, because the mean of its divisors is an integer number (7657169835).
Almost surely, 215314339669 is an apocalyptic number.
It is an amenable number.
15314339669 is a deficient number, since it is larger than the sum of its proper divisors (1).
15314339669 is an equidigital number, since it uses as much as digits as its factorization.
15314339669 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1574640, while the sum is 50.
The spelling of 15314339669 in words is "fifteen billion, three hundred fourteen million, three hundred thirty-nine thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •