Base | Representation |
---|---|
bin | 11000011011001100… |
… | …01110001011001110 |
3 | 1020211212110200221010 |
4 | 30031212032023032 |
5 | 203323413301410 |
6 | 10005105350050 |
7 | 642644606154 |
oct | 141546161316 |
9 | 36755420833 |
10 | 13113025230 |
11 | 5619a62a38 |
12 | 265b638326 |
13 | 130c926036 |
14 | 8c578b3d4 |
15 | 51b32ac20 |
hex | 30d98e2ce |
13113025230 has 16 divisors (see below), whose sum is σ = 31471260624. Its totient is φ = 3496806720.
The previous prime is 13113025217. The next prime is 13113025241. The reversal of 13113025230 is 3252031131.
13113025230 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 = 13113025197 and 13113025206.
It is a congruent number.
It is an unprimeable number.
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, 218550391 + ... + 218550450.
It is an arithmetic number, because the mean of its divisors is an integer number (1966953789).
Almost surely, 213113025230 is an apocalyptic number.
13113025230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13113025230 is an abundant number, since it is smaller than the sum of its proper divisors (18358235394).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13113025230 is a wasteful number, since it uses less digits than its factorization.
13113025230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 437100851.
The product of its (nonzero) digits is 540, while the sum is 21.
Adding to 13113025230 its reverse (3252031131), we get a palindrome (16365056361).
The spelling of 13113025230 in words is "thirteen billion, one hundred thirteen million, twenty-five thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •