Base | Representation |
---|---|
bin | 1100010011100110110… |
… | …0010101001101000001 |
3 | 202012201022111212010022 |
4 | 3010321230111031001 |
5 | 11430442324220001 |
6 | 241043044343225 |
7 | 21163134366023 |
oct | 3047154251501 |
9 | 665638455108 |
10 | 211421320001 |
11 | 81732906a41 |
12 | 34b846a4b15 |
13 | 16c246112a8 |
14 | a338d06013 |
15 | 5775ed911b |
hex | 3139b15341 |
211421320001 has 4 divisors (see below), whose sum is σ = 216577937604. Its totient is φ = 206264702400.
The previous prime is 211421319983. The next prime is 211421320031. The reversal of 211421320001 is 100023124112.
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 102553657600 + 108867662401 = 320240^2 + 329951^2 .
It is not a de Polignac number, because 211421320001 - 26 = 211421319937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211421320031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2578308740 + ... + 2578308821.
It is an arithmetic number, because the mean of its divisors is an integer number (54144484401).
Almost surely, 2211421320001 is an apocalyptic number.
It is an amenable number.
211421320001 is a deficient number, since it is larger than the sum of its proper divisors (5156617603).
211421320001 is an equidigital number, since it uses as much as digits as its factorization.
211421320001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5156617602.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 211421320001 its reverse (100023124112), we get a palindrome (311444444113).
The spelling of 211421320001 in words is "two hundred eleven billion, four hundred twenty-one million, three hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •