Base | Representation |
---|---|
bin | 1100010100010011111… |
… | …00000010001101111101 |
3 | 1111110101222222222010022 |
4 | 12022021330002031331 |
5 | 23413224034330300 |
6 | 522231451021525 |
7 | 42401545145330 |
oct | 6121174021575 |
9 | 1443358888108 |
10 | 423221011325 |
11 | 15353a255952 |
12 | 6a033a3a8a5 |
13 | 30ba9430328 |
14 | 166ac182617 |
15 | b020313285 |
hex | 6289f0237d |
423221011325 has 24 divisors (see below), whose sum is σ = 599816960448. Its totient is φ = 290183374080.
The previous prime is 423221011277. The next prime is 423221011327. The reversal of 423221011325 is 523110122324.
It is not a de Polignac number, because 423221011325 - 28 = 423221011069 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 423221011294 and 423221011303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (423221011327) 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 23 ways as a sum of consecutive naturals, for example, 2029109 + ... + 2227941.
It is an arithmetic number, because the mean of its divisors is an integer number (24992373352).
Almost surely, 2423221011325 is an apocalyptic number.
It is an amenable number.
423221011325 is a deficient number, since it is larger than the sum of its proper divisors (176595949123).
423221011325 is a wasteful number, since it uses less digits than its factorization.
423221011325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211013 (or 211008 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 423221011325 its reverse (523110122324), we get a palindrome (946331133649).
The spelling of 423221011325 in words is "four hundred twenty-three billion, two hundred twenty-one million, eleven thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •