Base | Representation |
---|---|
bin | 1001000110001100110011… |
… | …0100100101001100110101 |
3 | 1022102012012221202121211211 |
4 | 2101203030310211030311 |
5 | 2302333320232413023 |
6 | 33134524404201421 |
7 | 2051425601635333 |
oct | 221431464451465 |
9 | 38365187677754 |
10 | 10002120201013 |
11 | 320696a10a466 |
12 | 1156589999271 |
13 | 57727149a135 |
14 | 268168956b53 |
15 | 1252a114aa0d |
hex | 918ccd25335 |
10002120201013 has 8 divisors (see below), whose sum is σ = 10023275707200. Its totient is φ = 9980967225600.
The previous prime is 10002120201001. The next prime is 10002120201041. The reversal of 10002120201013 is 31010202120001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10002120201013 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10002120200984 and 10002120201002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10002120201043) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7387413 + ... + 8635861.
It is an arithmetic number, because the mean of its divisors is an integer number (1252909463400).
Almost surely, 210002120201013 is an apocalyptic number.
It is an amenable number.
10002120201013 is a deficient number, since it is larger than the sum of its proper divisors (21155506187).
10002120201013 is a wasteful number, since it uses less digits than its factorization.
10002120201013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1265387.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 10002120201013 its reverse (31010202120001), we get a palindrome (41012322321014).
The spelling of 10002120201013 in words is "ten trillion, two billion, one hundred twenty million, two hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •