Base | Representation |
---|---|
bin | 10001110010001011100… |
… | …001001011001000010110 |
3 | 11022211111001021201100122 |
4 | 101302023201023020112 |
5 | 130010341012111210 |
6 | 2333232533311542 |
7 | 154203026565605 |
oct | 21621341131026 |
9 | 4284431251318 |
10 | 1222111441430 |
11 | 431327059330 |
12 | 178a2a7955b2 |
13 | 8b324558169 |
14 | 43216dd7a3c |
15 | 21bcaecdb55 |
hex | 11c8b84b216 |
1222111441430 has 32 divisors (see below), whose sum is σ = 2399849538048. Its totient is φ = 444391740000.
The previous prime is 1222111441429. The next prime is 1222111441487. The reversal of 1222111441430 is 341441112221.
It is a super-2 number, since 2×12221114414302 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1222111441430.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 4404305 + ... + 4673555.
It is an arithmetic number, because the mean of its divisors is an integer number (74995298064).
Almost surely, 21222111441430 is an apocalyptic number.
1222111441430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1222111441430 is a deficient number, since it is larger than the sum of its proper divisors (1177738096618).
1222111441430 is a wasteful number, since it uses less digits than its factorization.
1222111441430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 310532.
The product of its (nonzero) digits is 1536, while the sum is 26.
Adding to 1222111441430 its reverse (341441112221), we get a palindrome (1563552553651).
The spelling of 1222111441430 in words is "one trillion, two hundred twenty-two billion, one hundred eleven million, four hundred forty-one thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.284 sec. • engine limits •