Base | Representation |
---|---|
bin | 10100111001101001… |
… | …10011010100110001 |
3 | 1001222000022222102110 |
4 | 22130310303110301 |
5 | 140440040201001 |
6 | 5053241235533 |
7 | 545032053600 |
oct | 123464632461 |
9 | 31860288373 |
10 | 11221022001 |
11 | 4838a79a02 |
12 | 2211a92ba9 |
13 | 109a9622b7 |
14 | 7863a5a37 |
15 | 45a19c3d6 |
hex | 29cd33531 |
11221022001 has 12 divisors (see below), whose sum is σ = 17404034352. Its totient is φ = 6412012488.
The previous prime is 11221021991. The next prime is 11221022051. The reversal of 11221022001 is 10022012211.
11221022001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11221022001 - 29 = 11221021489 is a prime.
It is a super-2 number, since 2×112210220012 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11221022051) 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 11 ways as a sum of consecutive naturals, for example, 38166595 + ... + 38166888.
It is an arithmetic number, because the mean of its divisors is an integer number (1450336196).
Almost surely, 211221022001 is an apocalyptic number.
It is an amenable number.
11221022001 is a deficient number, since it is larger than the sum of its proper divisors (6183012351).
11221022001 is an equidigital number, since it uses as much as digits as its factorization.
11221022001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76333500 (or 76333493 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 11221022001 its reverse (10022012211), we get a palindrome (21243034212).
The spelling of 11221022001 in words is "eleven billion, two hundred twenty-one million, twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •