Base | Representation |
---|---|
bin | 11011110111000010… |
… | …10101011100011111 |
3 | 1102121101200102022112 |
4 | 31323201111130133 |
5 | 221113023104142 |
6 | 10512105304235 |
7 | 1036440266003 |
oct | 157341253437 |
9 | 42541612275 |
10 | 14957238047 |
11 | 6385a75364 |
12 | 2a9519507b |
13 | 1544a2631b |
14 | a1c692703 |
15 | 5c81b9382 |
hex | 37b85571f |
14957238047 has 2 divisors, whose sum is σ = 14957238048. Its totient is φ = 14957238046.
The previous prime is 14957238011. The next prime is 14957238059. The reversal of 14957238047 is 74083275941.
It is a strong prime.
It is an emirp because it is prime and its reverse (74083275941) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14957238047 - 214 = 14957221663 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14957237986 and 14957238004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14957238847) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7478619023 + 7478619024.
It is an arithmetic number, because the mean of its divisors is an integer number (7478619024).
Almost surely, 214957238047 is an apocalyptic number.
14957238047 is a deficient number, since it is larger than the sum of its proper divisors (1).
14957238047 is an equidigital number, since it uses as much as digits as its factorization.
14957238047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1693440, while the sum is 50.
The spelling of 14957238047 in words is "fourteen billion, nine hundred fifty-seven million, two hundred thirty-eight thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •