Base | Representation |
---|---|
bin | 10010110110101011… |
… | …00101110101001110 |
3 | 222010102221012022022 |
4 | 21123111211311032 |
5 | 131212303234410 |
6 | 4352232250142 |
7 | 505561211420 |
oct | 113325456516 |
9 | 28112835268 |
10 | 10122321230 |
11 | 432487183a |
12 | 1b65b40952 |
13 | c54147ab8 |
14 | 6c04c4810 |
15 | 3e39c1455 |
hex | 25b565d4e |
10122321230 has 16 divisors (see below), whose sum is σ = 20823060960. Its totient is φ = 3470510112.
The previous prime is 10122321179. The next prime is 10122321281. The reversal of 10122321230 is 3212322101.
It is an interprime number because it is at equal distance from previous prime (10122321179) and next prime (10122321281).
It is a super-2 number, since 2×101223212302 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10122321199 and 10122321208.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 72302225 + ... + 72302364.
It is an arithmetic number, because the mean of its divisors is an integer number (1301441310).
Almost surely, 210122321230 is an apocalyptic number.
10122321230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10122321230 is an abundant number, since it is smaller than the sum of its proper divisors (10700739730).
10122321230 is a wasteful number, since it uses less digits than its factorization.
10122321230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144604603.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 10122321230 its reverse (3212322101), we get a palindrome (13334643331).
The spelling of 10122321230 in words is "ten billion, one hundred twenty-two million, three hundred twenty-one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •