Base | Representation |
---|---|
bin | 1001000110001100010110… |
… | …1010110110100101110011 |
3 | 1022102011220120222110112000 |
4 | 2101203011222312211303 |
5 | 2302333044023212131 |
6 | 33134504440305043 |
7 | 2051422614013215 |
oct | 221430552664563 |
9 | 38364816873460 |
10 | 10002000210291 |
11 | 3206908404681 |
12 | 1156555772183 |
13 | 5772526774cb |
14 | 268156a405b5 |
15 | 125295847ce6 |
hex | 918c5ab6973 |
10002000210291 has 16 divisors (see below), whose sum is σ = 14840263363200. Its totient is φ = 6657881766984.
The previous prime is 10002000210269. The next prime is 10002000210337. The reversal of 10002000210291 is 19201200020001.
10002000210291 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10002000210291 - 218 = 10001999948147 is a prime.
It is a super-2 number, since 2×100020002102912 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10002000217291) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 281047801 + ... + 281083386.
It is an arithmetic number, because the mean of its divisors is an integer number (927516460200).
Almost surely, 210002000210291 is an apocalyptic number.
10002000210291 is a deficient number, since it is larger than the sum of its proper divisors (4838263152909).
10002000210291 is an equidigital number, since it uses as much as digits as its factorization.
10002000210291 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 562131855 (or 562131849 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 10002000210291 its reverse (19201200020001), we get a palindrome (29203200230292).
The spelling of 10002000210291 in words is "ten trillion, two billion, two hundred ten thousand, two hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •