Base | Representation |
---|---|
bin | 1001000110001100011001… |
… | …0000111101110011010101 |
3 | 1022102011221021210001121102 |
4 | 2101203012100331303111 |
5 | 2302333104102420201 |
6 | 33134505434355445 |
7 | 2051423064644426 |
oct | 221430620756325 |
9 | 38364837701542 |
10 | 10002010201301 |
11 | 3206913009008 |
12 | 1156558b8bb85 |
13 | 577254764c51 |
14 | 2681580c164d |
15 | 12529666d26b |
hex | 918c643dcd5 |
10002010201301 has 4 divisors (see below), whose sum is σ = 10590363742572. Its totient is φ = 9413656660032.
The previous prime is 10002010201291. The next prime is 10002010201303. The reversal of 10002010201301 is 10310201020001.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5183699847076 + 4818310354225 = 2276774^2 + 2195065^2 .
It is a cyclic number.
It is not a de Polignac number, because 10002010201301 - 26 = 10002010201237 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 (10002010201303) 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, 294176770610 + ... + 294176770643.
It is an arithmetic number, because the mean of its divisors is an integer number (2647590935643).
Almost surely, 210002010201301 is an apocalyptic number.
It is an amenable number.
10002010201301 is a deficient number, since it is larger than the sum of its proper divisors (588353541271).
10002010201301 is an equidigital number, since it uses as much as digits as its factorization.
10002010201301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 588353541270.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 10002010201301 its reverse (10310201020001), we get a palindrome (20312211221302).
The spelling of 10002010201301 in words is "ten trillion, two billion, ten million, two hundred one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •