Base | Representation |
---|---|
bin | 11011000011100011… |
… | …10000011101100101 |
3 | 1101111021222111021002 |
4 | 31201301300131211 |
5 | 214221441213042 |
6 | 10401200203045 |
7 | 1022644212416 |
oct | 154161603545 |
9 | 41437874232 |
10 | 14525335397 |
11 | 618419a521 |
12 | 2994609485 |
13 | 14a63c4a21 |
14 | 9bb18580d |
15 | 5a0303132 |
hex | 361c70765 |
14525335397 has 2 divisors, whose sum is σ = 14525335398. Its totient is φ = 14525335396.
The previous prime is 14525335387. The next prime is 14525335411. The reversal of 14525335397 is 79353352541.
14525335397 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., 10054273441 + 4471061956 = 100271^2 + 66866^2 .
It is a cyclic number.
It is not a de Polignac number, because 14525335397 - 26 = 14525335333 is a prime.
It is a super-2 number, since 2×145253353972 (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 (14525335367) 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, 7262667698 + 7262667699.
It is an arithmetic number, because the mean of its divisors is an integer number (7262667699).
Almost surely, 214525335397 is an apocalyptic number.
It is an amenable number.
14525335397 is a deficient number, since it is larger than the sum of its proper divisors (1).
14525335397 is an equidigital number, since it uses as much as digits as its factorization.
14525335397 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1701000, while the sum is 47.
The spelling of 14525335397 in words is "fourteen billion, five hundred twenty-five million, three hundred thirty-five thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •