Base | Representation |
---|---|
bin | 1100010100110111101… |
… | …01001010100001101001 |
3 | 1111111011220212010220000 |
4 | 12022123311022201221 |
5 | 23414332411401413 |
6 | 522321333053213 |
7 | 42412151542545 |
oct | 6123365124151 |
9 | 1444156763800 |
10 | 423521200233 |
11 | 15368374925a |
12 | 6a0b8487209 |
13 | 30c266960c1 |
14 | 166d9da4a25 |
15 | b03b85d073 |
hex | 629bd4a869 |
423521200233 has 20 divisors (see below), whose sum is σ = 632724774528. Its totient is φ = 282321893880.
The previous prime is 423521200189. The next prime is 423521200237. The reversal of 423521200233 is 332002125324.
423521200233 is a `hidden beast` number, since 423 + 5 + 2 + 1 + 2 + 0 + 0 + 233 = 666.
It is not a de Polignac number, because 423521200233 - 217 = 423521069161 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 423521200197 and 423521200206.
It is not an unprimeable number, because it can be changed into a prime (423521200237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 685060 + ... + 1147322.
Almost surely, 2423521200233 is an apocalyptic number.
It is an amenable number.
423521200233 is a deficient number, since it is larger than the sum of its proper divisors (209203574295).
423521200233 is a wasteful number, since it uses less digits than its factorization.
423521200233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 473586 (or 473577 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 27.
Adding to 423521200233 its reverse (332002125324), we get a palindrome (755523325557).
The spelling of 423521200233 in words is "four hundred twenty-three billion, five hundred twenty-one million, two hundred thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •