Base | Representation |
---|---|
bin | 1010000001100000011011… |
… | …0010100100011010110001 |
3 | 1110000121010102212021022200 |
4 | 2200120012302210122301 |
5 | 2421032002000014301 |
6 | 35234551050253413 |
7 | 2215145440224531 |
oct | 240300662443261 |
9 | 43017112767280 |
10 | 11021000001201 |
11 | 3569a86202703 |
12 | 129bb3a727269 |
13 | 61c378039578 |
14 | 2a15c25a94c1 |
15 | 141a35106c86 |
hex | a0606ca46b1 |
11021000001201 has 12 divisors (see below), whose sum is σ = 16432745521920. Its totient is φ = 7110322581240.
The previous prime is 11021000001181. The next prime is 11021000001251. The reversal of 11021000001201 is 10210000012011.
It is a happy number.
It is not a de Polignac number, because 11021000001201 - 222 = 11020995806897 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (11021000001251) 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, 19750895781 + ... + 19750896338.
It is an arithmetic number, because the mean of its divisors is an integer number (1369395460160).
Almost surely, 211021000001201 is an apocalyptic number.
It is an amenable number.
11021000001201 is a deficient number, since it is larger than the sum of its proper divisors (5411745520719).
11021000001201 is a wasteful number, since it uses less digits than its factorization.
11021000001201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39501792156 (or 39501792153 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11021000001201 its reverse (10210000012011), we get a palindrome (21231000013212).
The spelling of 11021000001201 in words is "eleven trillion, twenty-one billion, one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •