Base | Representation |
---|---|
bin | 11010010000011110… |
… | …11101101001100111 |
3 | 1100101102211111000201 |
4 | 31020033131221213 |
5 | 212332302240142 |
6 | 10250453451331 |
7 | 1006222541455 |
oct | 151017355147 |
9 | 40342744021 |
10 | 14096915047 |
11 | 5a84382a16 |
12 | 2895040b47 |
13 | 1438712467 |
14 | 97a3039d5 |
15 | 5778c8ab7 |
hex | 3483dda67 |
14096915047 has 2 divisors, whose sum is σ = 14096915048. Its totient is φ = 14096915046.
The previous prime is 14096915023. The next prime is 14096915069. The reversal of 14096915047 is 74051969041.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 14096915047 - 227 = 13962697319 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14096914988 and 14096915006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14096919047) 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, 7048457523 + 7048457524.
It is an arithmetic number, because the mean of its divisors is an integer number (7048457524).
Almost surely, 214096915047 is an apocalyptic number.
14096915047 is a deficient number, since it is larger than the sum of its proper divisors (1).
14096915047 is an equidigital number, since it uses as much as digits as its factorization.
14096915047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 272160, while the sum is 46.
The spelling of 14096915047 in words is "fourteen billion, ninety-six million, nine hundred fifteen thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •