Base | Representation |
---|---|
bin | 10011001101010101… |
… | …01110110001000110 |
3 | 222121200121211010201 |
4 | 21212222232301012 |
5 | 132104434142410 |
6 | 4423142441114 |
7 | 513360025531 |
oct | 114652566106 |
9 | 28550554121 |
10 | 10312412230 |
11 | 44120a6a3a |
12 | 1bb973319a |
13 | c84642a93 |
14 | 6db847a18 |
15 | 40551e83a |
hex | 266aaec46 |
10312412230 has 16 divisors (see below), whose sum is σ = 18563527584. Its totient is φ = 4124701440.
The previous prime is 10312412219. The next prime is 10312412237. The reversal of 10312412230 is 3221421301.
It is a happy number.
10312412230 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 = 10312412198 and 10312412207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10312412237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 236215 + ... + 276445.
It is an arithmetic number, because the mean of its divisors is an integer number (1160220474).
Almost surely, 210312412230 is an apocalyptic number.
10312412230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10312412230 is a deficient number, since it is larger than the sum of its proper divisors (8251115354).
10312412230 is a wasteful number, since it uses less digits than its factorization.
10312412230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65871.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 10312412230 its reverse (3221421301), we get a palindrome (13533833531).
The spelling of 10312412230 in words is "ten billion, three hundred twelve million, four hundred twelve thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •