Base | Representation |
---|---|
bin | 1010001100100100111110… |
… | …1010010000011111010100 |
3 | 1110200210001212211020002222 |
4 | 2203021033222100133110 |
5 | 2432141014441321322 |
6 | 35502204340321512 |
7 | 2234661005114432 |
oct | 243111752203724 |
9 | 43623055736088 |
10 | 11211201120212 |
11 | 3632709836555 |
12 | 13109806a3298 |
13 | 63429a2279c2 |
14 | 2aa8a711bd52 |
15 | 146968198e42 |
hex | a324fa907d4 |
11211201120212 has 12 divisors (see below), whose sum is σ = 20773696193460. Its totient is φ = 5275859350656.
The previous prime is 11211201120191. The next prime is 11211201120227. The reversal of 11211201120212 is 21202110211211.
It can be written as a sum of positive squares in 2 ways, for example, as 4810635075856 + 6400566044356 = 2193316^2 + 2529934^2 .
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 82435302287 + ... + 82435302422.
It is an arithmetic number, because the mean of its divisors is an integer number (1731141349455).
Almost surely, 211211201120212 is an apocalyptic number.
It is an amenable number.
11211201120212 is a deficient number, since it is larger than the sum of its proper divisors (9562495073248).
11211201120212 is a wasteful number, since it uses less digits than its factorization.
11211201120212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164870604730 (or 164870604728 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 11211201120212 its reverse (21202110211211), we get a palindrome (32413311331423).
Subtracting 11211201120212 from its reverse (21202110211211), we obtain a palindrome (9990909090999).
The spelling of 11211201120212 in words is "eleven trillion, two hundred eleven billion, two hundred one million, one hundred twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •