Base | Representation |
---|---|
bin | 110000000110111011100111… |
… | …1100000101101011111110101 |
3 | 2001111022012011210022100202121 |
4 | 1200031313033200231133311 |
5 | 420431114143340001302 |
6 | 4055555213505435541 |
7 | 155063446340410564 |
oct | 14015671740553765 |
9 | 2044265153270677 |
10 | 423165134297077 |
11 | 112919364466997 |
12 | 3b5642a333bbb1 |
13 | 152173bb21b4b3 |
14 | 766d432131bdb |
15 | 33dc769cc8e37 |
hex | 180ddcf82d7f5 |
423165134297077 has 2 divisors, whose sum is σ = 423165134297078. Its totient is φ = 423165134297076.
The previous prime is 423165134297039. The next prime is 423165134297099. The reversal of 423165134297077 is 770792431561324.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 421228377774801 + 1936756522276 = 20523849^2 + 1391674^2 .
It is a cyclic number.
It is not a de Polignac number, because 423165134297077 - 231 = 423162986813429 is a prime.
It is a super-2 number, since 2×4231651342970772 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (423165134297777) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 211582567148538 + 211582567148539.
It is an arithmetic number, because the mean of its divisors is an integer number (211582567148539).
Almost surely, 2423165134297077 is an apocalyptic number.
It is an amenable number.
423165134297077 is a deficient number, since it is larger than the sum of its proper divisors (1).
423165134297077 is an equidigital number, since it uses as much as digits as its factorization.
423165134297077 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 53343360, while the sum is 61.
The spelling of 423165134297077 in words is "four hundred twenty-three trillion, one hundred sixty-five billion, one hundred thirty-four million, two hundred ninety-seven thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •