Base | Representation |
---|---|
bin | 1101011010101100111… |
… | …0100111000000100110 |
3 | 211000222100201001221220 |
4 | 3112223032213000212 |
5 | 12234034014003142 |
6 | 253520515321210 |
7 | 22440103450515 |
oct | 3265316470046 |
9 | 730870631856 |
10 | 230506000422 |
11 | 8983669a8a5 |
12 | 3880bbb0206 |
13 | 1897648a5b9 |
14 | b22980467c |
15 | 5ee16ee2ec |
hex | 35ab3a7026 |
230506000422 has 32 divisors (see below), whose sum is σ = 468895070592. Its totient is φ = 75526401984.
The previous prime is 230506000397. The next prime is 230506000427. The reversal of 230506000422 is 224000605032.
230506000422 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 230506000392 and 230506000401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230506000427) 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 15 ways as a sum of consecutive naturals, for example, 426183 + ... + 801650.
It is an arithmetic number, because the mean of its divisors is an integer number (14652970956).
Almost surely, 2230506000422 is an apocalyptic number.
230506000422 is an abundant number, since it is smaller than the sum of its proper divisors (238389070170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230506000422 is a wasteful number, since it uses less digits than its factorization.
230506000422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1228372.
The product of its (nonzero) digits is 2880, while the sum is 24.
Adding to 230506000422 its reverse (224000605032), we get a palindrome (454506605454).
The spelling of 230506000422 in words is "two hundred thirty billion, five hundred six million, four hundred twenty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •