Base | Representation |
---|---|
bin | 10011001011111110… |
… | …10111000101000101 |
3 | 222120220020012111121 |
4 | 21211333113011011 |
5 | 132044031334023 |
6 | 4422055033541 |
7 | 513161264242 |
oct | 114577270505 |
9 | 28526205447 |
10 | 10301043013 |
11 | 4406741098 |
12 | 1bb596b8b1 |
13 | c82191c31 |
14 | 6da1285c9 |
15 | 404525d5d |
hex | 265fd7145 |
10301043013 has 4 divisors (see below), whose sum is σ = 10304195488. Its totient is φ = 10297890540.
The previous prime is 10301042989. The next prime is 10301043017. The reversal of 10301043013 is 31034010301.
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 10301043013 - 25 = 10301042981 is a prime.
It is a super-2 number, since 2×103010430132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10301043017) 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 3 ways as a sum of consecutive naturals, for example, 1571331 + ... + 1577872.
It is an arithmetic number, because the mean of its divisors is an integer number (2576048872).
Almost surely, 210301043013 is an apocalyptic number.
It is an amenable number.
10301043013 is a deficient number, since it is larger than the sum of its proper divisors (3152475).
10301043013 is an equidigital number, since it uses as much as digits as its factorization.
10301043013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3152474.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 10301043013 its reverse (31034010301), we get a palindrome (41335053314).
The spelling of 10301043013 in words is "ten billion, three hundred one million, forty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •