Base | Representation |
---|---|
bin | 1010000000110111110100… |
… | …0110010111010111001001 |
3 | 1102222112222210120211220221 |
4 | 2200031331012113113021 |
5 | 2420342141100001301 |
6 | 35225545313350041 |
7 | 2214311353601131 |
oct | 240157506272711 |
9 | 42875883524827 |
10 | 11010100000201 |
11 | 35653a2465615 |
12 | 12999b8268321 |
13 | 61b32ba55133 |
14 | 2a0c6aac9ac1 |
15 | 1415e821bda1 |
hex | a037d1975c9 |
11010100000201 has 8 divisors (see below), whose sum is σ = 11697892771680. Its totient is φ = 10333138611168.
The previous prime is 11010100000181. The next prime is 11010100000217. The reversal of 11010100000201 is 10200000101011.
11010100000201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 11010100000201 - 223 = 11010091611593 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11010100006201) 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, 2707843516 + ... + 2707847581.
It is an arithmetic number, because the mean of its divisors is an integer number (1462236596460).
Almost surely, 211010100000201 is an apocalyptic number.
It is an amenable number.
11010100000201 is a deficient number, since it is larger than the sum of its proper divisors (687792771479).
11010100000201 is a wasteful number, since it uses less digits than its factorization.
11010100000201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5415691223.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 11010100000201 its reverse (10200000101011), we get a palindrome (21210100101212).
The spelling of 11010100000201 in words is "eleven trillion, ten billion, one hundred million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.992 sec. • engine limits •