Base | Representation |
---|---|
bin | 10100100001110110… |
… | …00000100010100001 |
3 | 1001110002120012001222 |
4 | 22100323000202201 |
5 | 140032424304101 |
6 | 5021345104425 |
7 | 540055460165 |
oct | 122073004241 |
9 | 31402505058 |
10 | 11021322401 |
11 | 4746281711 |
12 | 2177028115 |
13 | 106848195b |
14 | 767a60ca5 |
15 | 4478a201b |
hex | 290ec08a1 |
11021322401 has 4 divisors (see below), whose sum is σ = 11065232304. Its totient is φ = 10977412500.
The previous prime is 11021322397. The next prime is 11021322409. The reversal of 11021322401 is 10422312011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 10422312011 = 12487 ⋅834653.
It is a cyclic number.
It is not a de Polignac number, because 11021322401 - 22 = 11021322397 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11021322401.
It is not an unprimeable number, because it can be changed into a prime (11021322409) 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, 21954575 + ... + 21955076.
It is an arithmetic number, because the mean of its divisors is an integer number (2766308076).
Almost surely, 211021322401 is an apocalyptic number.
It is an amenable number.
11021322401 is a deficient number, since it is larger than the sum of its proper divisors (43909903).
11021322401 is an equidigital number, since it uses as much as digits as its factorization.
11021322401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43909902.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 11021322401 its reverse (10422312011), we get a palindrome (21443634412).
The spelling of 11021322401 in words is "eleven billion, twenty-one million, three hundred twenty-two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •