Base | Representation |
---|---|
bin | 1001000110101110101010… |
… | …1000001011101110010001 |
3 | 1022110001200110012112000002 |
4 | 2101223222220023232101 |
5 | 2303010424302431001 |
6 | 33143030402335345 |
7 | 2052200056445051 |
oct | 221535250135621 |
9 | 38401613175002 |
10 | 10011210202001 |
11 | 320a804192778 |
12 | 11582a605a555 |
13 | 57808c79c948 |
14 | 26878bcb9561 |
15 | 1256341a446b |
hex | 91aeaa0bb91 |
10011210202001 has 8 divisors (see below), whose sum is σ = 10461987110784. Its totient is φ = 9570340478160.
The previous prime is 10011210201983. The next prime is 10011210202027. The reversal of 10011210202001 is 10020201211001.
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-10011210202001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10011210502001) 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, 2476794170 + ... + 2476798211.
It is an arithmetic number, because the mean of its divisors is an integer number (1307748388848).
Almost surely, 210011210202001 is an apocalyptic number.
It is an amenable number.
10011210202001 is a deficient number, since it is larger than the sum of its proper divisors (450776908783).
10011210202001 is an equidigital number, since it uses as much as digits as its factorization.
10011210202001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4953592471.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10011210202001 its reverse (10020201211001), we get a palindrome (20031411413002).
It can be divided in two parts, 10011 and 210202001, that added together give a palindrome (210212012).
The spelling of 10011210202001 in words is "ten trillion, eleven billion, two hundred ten million, two hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •