Base | Representation |
---|---|
bin | 11001001101101… |
… | …010101010011101 |
3 | 1002110222021202221 |
4 | 121031222222131 |
5 | 1331242404041 |
6 | 105550345341 |
7 | 13324360054 |
oct | 3115525235 |
9 | 1073867687 |
10 | 423013021 |
11 | 1a7863a42 |
12 | b97bb251 |
13 | 6983b282 |
14 | 4027539b |
15 | 2720c2d1 |
hex | 1936aa9d |
423013021 has 2 divisors, whose sum is σ = 423013022. Its totient is φ = 423013020.
The previous prime is 423013013. The next prime is 423013037. The reversal of 423013021 is 120310324.
It is a happy number.
It is an a-pointer prime, because the next prime (423013037) can be obtained adding 423013021 to its sum of digits (16).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 263900025 + 159112996 = 16245^2 + 12614^2 .
It is a cyclic number.
It is not a de Polignac number, because 423013021 - 23 = 423013013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 423012986 and 423013004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (423013121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 211506510 + 211506511.
It is an arithmetic number, because the mean of its divisors is an integer number (211506511).
Almost surely, 2423013021 is an apocalyptic number.
It is an amenable number.
423013021 is a deficient number, since it is larger than the sum of its proper divisors (1).
423013021 is an equidigital number, since it uses as much as digits as its factorization.
423013021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 423013021 is about 20567.2803501095. The cubic root of 423013021 is about 750.6737773324.
Adding to 423013021 its reverse (120310324), we get a palindrome (543323345).
The spelling of 423013021 in words is "four hundred twenty-three million, thirteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •