Base | Representation |
---|---|
bin | 11011100100110111… |
… | …00100101111000101 |
3 | 1102012202201100112121 |
4 | 31302123210233011 |
5 | 220310002422434 |
6 | 10445020445541 |
7 | 1032606103333 |
oct | 156233445705 |
9 | 42182640477 |
10 | 14804732869 |
11 | 6307981a23 |
12 | 2a520a98b1 |
13 | 151c25b084 |
14 | a06314b53 |
15 | 5b9ae27b4 |
hex | 3726e4bc5 |
14804732869 has 2 divisors, whose sum is σ = 14804732870. Its totient is φ = 14804732868.
The previous prime is 14804732867. The next prime is 14804732881. The reversal of 14804732869 is 96823740841.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9038304900 + 5766427969 = 95070^2 + 75937^2 .
It is an emirp because it is prime and its reverse (96823740841) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14804732869 - 21 = 14804732867 is a prime.
It is a super-2 number, since 2×148047328692 (a number of 21 digits) contains 22 as substring.
Together with 14804732867, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14804732861) 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, 7402366434 + 7402366435.
It is an arithmetic number, because the mean of its divisors is an integer number (7402366435).
Almost surely, 214804732869 is an apocalyptic number.
It is an amenable number.
14804732869 is a deficient number, since it is larger than the sum of its proper divisors (1).
14804732869 is an equidigital number, since it uses as much as digits as its factorization.
14804732869 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2322432, while the sum is 52.
The spelling of 14804732869 in words is "fourteen billion, eight hundred four million, seven hundred thirty-two thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •