Base | Representation |
---|---|
bin | 1100010010110100101… |
… | …1100011100000000110 |
3 | 202012011200111212200201 |
4 | 3010231023203200012 |
5 | 11430030104314342 |
6 | 241010145201114 |
7 | 21155005200643 |
oct | 3045513434006 |
9 | 665150455621 |
10 | 211211401222 |
11 | 81635369948 |
12 | 34b2633019a |
13 | 16bbcc933b3 |
14 | a3190a0dca |
15 | 5762870db7 |
hex | 312d2e3806 |
211211401222 has 64 divisors (see below), whose sum is σ = 344064672000. Its totient is φ = 96933445632.
The previous prime is 211211401183. The next prime is 211211401229. The reversal of 211211401222 is 222104112112.
211211401222 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2112114012222 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a self number, because there is not a number n which added to its sum of digits gives 211211401222.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211211401229) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 55888929 + ... + 55892707.
It is an arithmetic number, because the mean of its divisors is an integer number (5376010500).
Almost surely, 2211211401222 is an apocalyptic number.
211211401222 is a deficient number, since it is larger than the sum of its proper divisors (132853270778).
211211401222 is a wasteful number, since it uses less digits than its factorization.
211211401222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4213.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 211211401222 its reverse (222104112112), we get a palindrome (433315513334).
The spelling of 211211401222 in words is "two hundred eleven billion, two hundred eleven million, four hundred one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •