Base | Representation |
---|---|
bin | 1101001000110111110010… |
… | …0011010010000011111101 |
3 | 1220011000211002020111200111 |
4 | 3102031330203102003331 |
5 | 3343141020021442003 |
6 | 50420232552230021 |
7 | 3020456643262231 |
oct | 322157443220375 |
9 | 56130732214614 |
10 | 14446064640253 |
11 | 466a5a5977004 |
12 | 17538b199b311 |
13 | 80a347c2366c |
14 | 37d29c4365c1 |
15 | 1a0b96933e6d |
hex | d237c8d20fd |
14446064640253 has 2 divisors, whose sum is σ = 14446064640254. Its totient is φ = 14446064640252.
The previous prime is 14446064640247. The next prime is 14446064640277. The reversal of 14446064640253 is 35204646064441.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14152358089444 + 293706550809 = 3761962^2 + 541947^2 .
It is a cyclic number.
It is not a de Polignac number, because 14446064640253 - 213 = 14446064632061 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14446064640197 and 14446064640206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14446064680253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7223032320126 + 7223032320127.
It is an arithmetic number, because the mean of its divisors is an integer number (7223032320127).
Almost surely, 214446064640253 is an apocalyptic number.
It is an amenable number.
14446064640253 is a deficient number, since it is larger than the sum of its proper divisors (1).
14446064640253 is an equidigital number, since it uses as much as digits as its factorization.
14446064640253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6635520, while the sum is 49.
The spelling of 14446064640253 in words is "fourteen trillion, four hundred forty-six billion, sixty-four million, six hundred forty thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •