Base | Representation |
---|---|
bin | 10100101110001001011… |
… | …010111110000011001101 |
3 | 12001010102210210202022122 |
4 | 110232021122332003031 |
5 | 141312212032122334 |
6 | 3010052054022325 |
7 | 204606360642134 |
oct | 24561132760315 |
9 | 5033383722278 |
10 | 1423939723469 |
11 | 4a998694091a |
12 | 1abb766479a5 |
13 | a437a58a413 |
14 | 4ccc1c3491b |
15 | 2708ebe632e |
hex | 14b896be0cd |
1423939723469 has 2 divisors, whose sum is σ = 1423939723470. Its totient is φ = 1423939723468.
The previous prime is 1423939723441. The next prime is 1423939723471. The reversal of 1423939723469 is 9643279393241.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 778788600100 + 645151123369 = 882490^2 + 803213^2 .
It is a cyclic number.
It is not a de Polignac number, because 1423939723469 - 212 = 1423939719373 is a prime.
It is a super-2 number, since 2×14239397234692 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 1423939723471, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1423939723429) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 711969861734 + 711969861735.
It is an arithmetic number, because the mean of its divisors is an integer number (711969861735).
Almost surely, 21423939723469 is an apocalyptic number.
It is an amenable number.
1423939723469 is a deficient number, since it is larger than the sum of its proper divisors (1).
1423939723469 is an equidigital number, since it uses as much as digits as its factorization.
1423939723469 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 52907904, while the sum is 62.
The spelling of 1423939723469 in words is "one trillion, four hundred twenty-three billion, nine hundred thirty-nine million, seven hundred twenty-three thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •