Base | Representation |
---|---|
bin | 10011001100000000… |
… | …11010111100110101 |
3 | 222120220202022211220 |
4 | 21212000122330311 |
5 | 132044114233023 |
6 | 4422105020553 |
7 | 513163532604 |
oct | 114600327465 |
9 | 28526668756 |
10 | 10301321013 |
11 | 4406910a45 |
12 | 1bb5a84759 |
13 | c8225b629 |
14 | 6da19ba3b |
15 | 40457d3e3 |
hex | 26601af35 |
10301321013 has 4 divisors (see below), whose sum is σ = 13735094688. Its totient is φ = 6867547340.
The previous prime is 10301320993. The next prime is 10301321027. The reversal of 10301321013 is 31012310301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10301321013 - 26 = 10301320949 is a prime.
It is a super-2 number, since 2×103013210132 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10301320983 and 10301321001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10301321083) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1716886833 + ... + 1716886838.
It is an arithmetic number, because the mean of its divisors is an integer number (3433773672).
Almost surely, 210301321013 is an apocalyptic number.
It is an amenable number.
10301321013 is a deficient number, since it is larger than the sum of its proper divisors (3433773675).
10301321013 is an equidigital number, since it uses as much as digits as its factorization.
10301321013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3433773674.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 10301321013 its reverse (31012310301), we get a palindrome (41313631314).
The spelling of 10301321013 in words is "ten billion, three hundred one million, three hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •