Base | Representation |
---|---|
bin | 10010101011110010… |
… | …10001110110110101 |
3 | 221220002010021101011 |
4 | 21111321101312311 |
5 | 131020414411201 |
6 | 4335211232221 |
7 | 503402130511 |
oct | 112571216665 |
9 | 27802107334 |
10 | 10031013301 |
11 | 4288277841 |
12 | 1b3b448671 |
13 | c3b25873a |
14 | 6b2317141 |
15 | 3da987151 |
hex | 255e51db5 |
10031013301 has 8 divisors (see below), whose sum is σ = 10444128408. Its totient is φ = 9625920000.
The previous prime is 10031013287. The next prime is 10031013329. The reversal of 10031013301 is 10331013001.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 631516900 + 9399496401 = 25130^2 + 96951^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10031013301 - 27 = 10031013173 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10031013331) 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 7 ways as a sum of consecutive naturals, for example, 2002900 + ... + 2007901.
It is an arithmetic number, because the mean of its divisors is an integer number (1305516051).
Almost surely, 210031013301 is an apocalyptic number.
It is an amenable number.
10031013301 is a deficient number, since it is larger than the sum of its proper divisors (413115107).
10031013301 is an equidigital number, since it uses as much as digits as its factorization.
10031013301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4010903.
The product of its (nonzero) digits is 27, while the sum is 13.
Adding to 10031013301 its reverse (10331013001), we get a palindrome (20362026302).
The spelling of 10031013301 in words is "ten billion, thirty-one million, thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •