Base | Representation |
---|---|
bin | 11000110011111000… |
… | …01100110001001110 |
3 | 1021101022010212021001 |
4 | 30121330030301032 |
5 | 204234422110410 |
6 | 10041424130514 |
7 | 651041044234 |
oct | 143174146116 |
9 | 37338125231 |
10 | 13320113230 |
11 | 5715947246 |
12 | 26b8a66a3a |
13 | 13437c2608 |
14 | 905096954 |
15 | 52e5d533a |
hex | 319f0cc4e |
13320113230 has 16 divisors (see below), whose sum is σ = 23977580544. Its totient is φ = 5327739360.
The previous prime is 13320113227. The next prime is 13320113239. The reversal of 13320113230 is 3231102331.
13320113230 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 = 13320113198 and 13320113207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13320113239) 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, 243379 + ... + 293041.
It is an arithmetic number, because the mean of its divisors is an integer number (1498598784).
Almost surely, 213320113230 is an apocalyptic number.
13320113230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13320113230 is a deficient number, since it is larger than the sum of its proper divisors (10657467314).
13320113230 is a wasteful number, since it uses less digits than its factorization.
13320113230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76491.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 13320113230 its reverse (3231102331), we get a palindrome (16551215561).
The spelling of 13320113230 in words is "thirteen billion, three hundred twenty million, one hundred thirteen thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •