Base | Representation |
---|---|
bin | 1001100110000111101011… |
… | …01011100111110001111001 |
3 | 2202201020101001111001200102 |
4 | 10303003311223213301321 |
5 | 10231204322302223001 |
6 | 112513355515045145 |
7 | 4305332323632635 |
oct | 463036553476171 |
9 | 82636331431612 |
10 | 21101001211001 |
11 | 67a5980099738 |
12 | 24496227407b5 |
13 | ba0a7b63144a |
14 | 52d4186a9dc5 |
15 | 268d436a6e6b |
hex | 1330f5ae7c79 |
21101001211001 has 4 divisors (see below), whose sum is σ = 22342236576372. Its totient is φ = 19859765845632.
The previous prime is 21101001210997. The next prime is 21101001211007. The reversal of 21101001211001 is 10011210010112.
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 13169089397776 + 7931911813225 = 3628924^2 + 2816365^2 .
It is a cyclic number.
It is not a de Polignac number, because 21101001211001 - 22 = 21101001210997 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21101001211007) 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, 620617682660 + ... + 620617682693.
It is an arithmetic number, because the mean of its divisors is an integer number (5585559144093).
Almost surely, 221101001211001 is an apocalyptic number.
It is an amenable number.
21101001211001 is a deficient number, since it is larger than the sum of its proper divisors (1241235365371).
21101001211001 is a wasteful number, since it uses less digits than its factorization.
21101001211001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1241235365370.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 21101001211001 its reverse (10011210010112), we get a palindrome (31112211221113).
The spelling of 21101001211001 in words is "twenty-one trillion, one hundred one billion, one million, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •