Base | Representation |
---|---|
bin | 10100011000100011010… |
… | …101100111001001100001 |
3 | 11221220120211101211201101 |
4 | 110120203111213021201 |
5 | 140422220031101213 |
6 | 2551255141034401 |
7 | 203125642205506 |
oct | 24304325471141 |
9 | 4856524354641 |
10 | 1400752206433 |
11 | 4a00681150a8 |
12 | 1a75850b5a01 |
13 | a21236c4a38 |
14 | 4bb224934ad |
15 | 266841e5bdd |
hex | 14623567261 |
1400752206433 has 2 divisors, whose sum is σ = 1400752206434. Its totient is φ = 1400752206432.
The previous prime is 1400752206431. The next prime is 1400752206443. The reversal of 1400752206433 is 3346022570041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 836919417889 + 563832788544 = 914833^2 + 750888^2 .
It is a cyclic number.
It is not a de Polignac number, because 1400752206433 - 21 = 1400752206431 is a prime.
Together with 1400752206431, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1400752206392 and 1400752206401.
It is not a weakly prime, because it can be changed into another prime (1400752206431) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 700376103216 + 700376103217.
It is an arithmetic number, because the mean of its divisors is an integer number (700376103217).
Almost surely, 21400752206433 is an apocalyptic number.
It is an amenable number.
1400752206433 is a deficient number, since it is larger than the sum of its proper divisors (1).
1400752206433 is an equidigital number, since it uses as much as digits as its factorization.
1400752206433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 120960, while the sum is 37.
Adding to 1400752206433 its reverse (3346022570041), we get a palindrome (4746774776474).
The spelling of 1400752206433 in words is "one trillion, four hundred billion, seven hundred fifty-two million, two hundred six thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •