Base | Representation |
---|---|
bin | 11010010000011101… |
… | …10001010111010101 |
3 | 1100101102111021012102 |
4 | 31020032301113111 |
5 | 212332230434103 |
6 | 10250445531445 |
7 | 1006221154562 |
oct | 151016612725 |
9 | 40342437172 |
10 | 14096733653 |
11 | 5a84269702 |
12 | 2894b73b85 |
13 | 143867aa22 |
14 | 97a297869 |
15 | 57788ee88 |
hex | 3483b15d5 |
14096733653 has 2 divisors, whose sum is σ = 14096733654. Its totient is φ = 14096733652.
The previous prime is 14096733617. The next prime is 14096733661. The reversal of 14096733653 is 35633769041.
14096733653 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13660466884 + 436266769 = 116878^2 + 20887^2 .
It is a cyclic number.
It is not a de Polignac number, because 14096733653 - 212 = 14096729557 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14096733598 and 14096733607.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14096733613) 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, 7048366826 + 7048366827.
It is an arithmetic number, because the mean of its divisors is an integer number (7048366827).
Almost surely, 214096733653 is an apocalyptic number.
It is an amenable number.
14096733653 is a deficient number, since it is larger than the sum of its proper divisors (1).
14096733653 is an equidigital number, since it uses as much as digits as its factorization.
14096733653 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1224720, while the sum is 47.
The spelling of 14096733653 in words is "fourteen billion, ninety-six million, seven hundred thirty-three thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •