Base | Representation |
---|---|
bin | 1100010100100010000… |
… | …01111111001001100001 |
3 | 1111110201021220211112111 |
4 | 12022101001333021201 |
5 | 23414000020342004 |
6 | 522251341355321 |
7 | 42404521505416 |
oct | 6122101771141 |
9 | 1443637824474 |
10 | 423340012129 |
11 | 1535a0444a21 |
12 | 6a067868b41 |
13 | 30bc7c974c8 |
14 | 166bdcbc10d |
15 | b02a9bca04 |
hex | 629107f261 |
423340012129 has 2 divisors, whose sum is σ = 423340012130. Its totient is φ = 423340012128.
The previous prime is 423340012087. The next prime is 423340012133. The reversal of 423340012129 is 921210043324.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 419453113104 + 3886899025 = 647652^2 + 62345^2 .
It is a cyclic number.
It is not a de Polignac number, because 423340012129 - 211 = 423340010081 is a prime.
It is a super-2 number, since 2×4233400121292 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 423340012129.
It is not a weakly prime, because it can be changed into another prime (423340012159) 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, 211670006064 + 211670006065.
It is an arithmetic number, because the mean of its divisors is an integer number (211670006065).
Almost surely, 2423340012129 is an apocalyptic number.
It is an amenable number.
423340012129 is a deficient number, since it is larger than the sum of its proper divisors (1).
423340012129 is an equidigital number, since it uses as much as digits as its factorization.
423340012129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 31.
The spelling of 423340012129 in words is "four hundred twenty-three billion, three hundred forty million, twelve thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •