Base | Representation |
---|---|
bin | 1010000001011101000100… |
… | …1010001001010100100001 |
3 | 1110000111210201202020120202 |
4 | 2200113101022021110201 |
5 | 2421023131123241001 |
6 | 35234321504514545 |
7 | 2215114233154436 |
oct | 240272112112441 |
9 | 43014721666522 |
10 | 11020100212001 |
11 | 3569664304771 |
12 | 129b92931ba55 |
13 | 61c2637b7b1a |
14 | 2a1538ca5b8d |
15 | 1419d111c96b |
hex | a05d1289521 |
11020100212001 has 4 divisors (see below), whose sum is σ = 11021505665604. Its totient is φ = 11018694758400.
The previous prime is 11020100211893. The next prime is 11020100212063. The reversal of 11020100212001 is 10021200102011.
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 5735181990976 + 5284918221025 = 2394824^2 + 2298895^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11020100212001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11020100412001) 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, 702715040 + ... + 702730721.
It is an arithmetic number, because the mean of its divisors is an integer number (2755376416401).
Almost surely, 211020100212001 is an apocalyptic number.
It is an amenable number.
11020100212001 is a deficient number, since it is larger than the sum of its proper divisors (1405453603).
11020100212001 is an equidigital number, since it uses as much as digits as its factorization.
11020100212001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1405453602.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 11020100212001 its reverse (10021200102011), we get a palindrome (21041300314012).
The spelling of 11020100212001 in words is "eleven trillion, twenty billion, one hundred million, two hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •