Base | Representation |
---|---|
bin | 11000011100010011… |
… | …11111101110011110 |
3 | 1020212112010011010110 |
4 | 30032021333232132 |
5 | 203333313400410 |
6 | 10010042350450 |
7 | 643120405236 |
oct | 141611775636 |
9 | 36775104113 |
10 | 13122403230 |
11 | 5624288852 |
12 | 26627bb426 |
13 | 131185a751 |
14 | 8c6b0ccc6 |
15 | 51c07e720 |
hex | 30e27fb9e |
13122403230 has 64 divisors (see below), whose sum is σ = 32921395200. Its totient is φ = 3343541760.
The previous prime is 13122403223. The next prime is 13122403247. The reversal of 13122403230 is 3230422131.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13122403197 and 13122403206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 15835 + ... + 162774.
It is an arithmetic number, because the mean of its divisors is an integer number (514396800).
Almost surely, 213122403230 is an apocalyptic number.
13122403230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 13122403230, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16460697600).
13122403230 is an abundant number, since it is smaller than the sum of its proper divisors (19798991970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13122403230 is a wasteful number, since it uses less digits than its factorization.
13122403230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 178729.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 13122403230 its reverse (3230422131), we get a palindrome (16352825361).
The spelling of 13122403230 in words is "thirteen billion, one hundred twenty-two million, four hundred three thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •