Base | Representation |
---|---|
bin | 10011001100000000… |
… | …00100110011101001 |
3 | 222120220120201102122 |
4 | 21212000010303221 |
5 | 132044103332223 |
6 | 4422103041025 |
7 | 513163004303 |
oct | 114600046351 |
9 | 28526521378 |
10 | 10301230313 |
11 | 4406859890 |
12 | 1bb5a40175 |
13 | c8222926a |
14 | 6da176973 |
15 | 4045615c8 |
hex | 266004ce9 |
10301230313 has 16 divisors (see below), whose sum is σ = 11330841600. Its totient is φ = 9287443200.
The previous prime is 10301230309. The next prime is 10301230333. The reversal of 10301230313 is 31303210301.
It is a cyclic number.
It is not a de Polignac number, because 10301230313 - 22 = 10301230309 is a prime.
It is a super-3 number, since 3×103012303133 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10301230291 and 10301230300.
It is not an unprimeable number, because it can be changed into a prime (10301230333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 700763 + ... + 715311.
It is an arithmetic number, because the mean of its divisors is an integer number (708177600).
Almost surely, 210301230313 is an apocalyptic number.
It is an amenable number.
10301230313 is a deficient number, since it is larger than the sum of its proper divisors (1029611287).
10301230313 is a wasteful number, since it uses less digits than its factorization.
10301230313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15088.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 10301230313 its reverse (31303210301), we get a palindrome (41604440614).
The spelling of 10301230313 in words is "ten billion, three hundred one million, two hundred thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •