Base | Representation |
---|---|
bin | 10110111011110111… |
… | …00000110000101101 |
3 | 1011210010122110011122 |
4 | 23131323200300231 |
5 | 200204201100023 |
6 | 5353500430325 |
7 | 614064215600 |
oct | 133573406055 |
9 | 34703573148 |
10 | 12313300013 |
11 | 524959a603 |
12 | 24778483a5 |
13 | 121303b251 |
14 | 84b494337 |
15 | 4c100a2c8 |
hex | 2ddee0c2d |
12313300013 has 12 divisors (see below), whose sum is σ = 14374624572. Its totient is φ = 10516685760.
The previous prime is 12313300009. The next prime is 12313300049. The reversal of 12313300013 is 31000331321.
It can be written as a sum of positive squares in 2 ways, for example, as 8461608169 + 3851691844 = 91987^2 + 62062^2 .
It is not a de Polignac number, because 12313300013 - 22 = 12313300009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12313299964 and 12313300000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12313300093) 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 11 ways as a sum of consecutive naturals, for example, 433370 + ... + 460907.
It is an arithmetic number, because the mean of its divisors is an integer number (1197885381).
Almost surely, 212313300013 is an apocalyptic number.
It is an amenable number.
12313300013 is a deficient number, since it is larger than the sum of its proper divisors (2061324559).
12313300013 is an equidigital number, since it uses as much as digits as its factorization.
12313300013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 894572 (or 894565 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 12313300013 its reverse (31000331321), we get a palindrome (43313631334).
The spelling of 12313300013 in words is "twelve billion, three hundred thirteen million, three hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •