Base | Representation |
---|---|
bin | 11010011100001010… |
… | …101101000100001001 |
3 | 2201021112112002100112 |
4 | 122130022231010021 |
5 | 431120300333442 |
6 | 21013033044105 |
7 | 2023345535003 |
oct | 323412550411 |
9 | 81245462315 |
10 | 28389855497 |
11 | 110493736a3 |
12 | 5603856635 |
13 | 28a5919a83 |
14 | 1534673373 |
15 | b125c4082 |
hex | 69c2ad109 |
28389855497 has 2 divisors, whose sum is σ = 28389855498. Its totient is φ = 28389855496.
The previous prime is 28389855479. The next prime is 28389855509. The reversal of 28389855497 is 79455898382.
Together with previous prime (28389855479) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 25940001481 + 2449854016 = 161059^2 + 49496^2 .
It is a cyclic number.
It is not a de Polignac number, because 28389855497 - 224 = 28373078281 is a prime.
It is a super-2 number, since 2×283898554972 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (28389855407) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 14194927748 + 14194927749.
It is an arithmetic number, because the mean of its divisors is an integer number (14194927749).
Almost surely, 228389855497 is an apocalyptic number.
It is an amenable number.
28389855497 is a deficient number, since it is larger than the sum of its proper divisors (1).
28389855497 is an equidigital number, since it uses as much as digits as its factorization.
28389855497 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 174182400, while the sum is 68.
It can be divided in two parts, 2838985 and 5497, that added together give a palindrome (2844482).
The spelling of 28389855497 in words is "twenty-eight billion, three hundred eighty-nine million, eight hundred fifty-five thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •