Base | Representation |
---|---|
bin | 10110111101110111… |
… | …01001000101010001 |
3 | 1011211022021112221101 |
4 | 23132323221011101 |
5 | 200223002030223 |
6 | 5355301024401 |
7 | 614360134252 |
oct | 133673510521 |
9 | 34738245841 |
10 | 12330111313 |
11 | 5258032143 |
12 | 24813b5101 |
13 | 1216676170 |
14 | 84d7ccb29 |
15 | 4c272b4ad |
hex | 2deee9151 |
12330111313 has 24 divisors (see below), whose sum is σ = 14045403456. Its totient is φ = 10758636000.
The previous prime is 12330111301. The next prime is 12330111323. The reversal of 12330111313 is 31311103321.
It is not a de Polignac number, because 12330111313 - 25 = 12330111281 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12330111323) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 2301588 + ... + 2306938.
It is an arithmetic number, because the mean of its divisors is an integer number (585225144).
Almost surely, 212330111313 is an apocalyptic number.
12330111313 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
12330111313 is a deficient number, since it is larger than the sum of its proper divisors (1715292143).
12330111313 is a wasteful number, since it uses less digits than its factorization.
12330111313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5893 (or 5874 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 12330111313 its reverse (31311103321), we get a palindrome (43641214634).
The spelling of 12330111313 in words is "twelve billion, three hundred thirty million, one hundred eleven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •