Base | Representation |
---|---|
bin | 111101011100010101100… |
… | …001101101100111110011 |
3 | 112221122112022201121011222 |
4 | 331130111201231213303 |
5 | 1023134244341323443 |
6 | 12551412042455255 |
7 | 614023606632125 |
oct | 75342541554763 |
9 | 15848468647158 |
10 | 4222314011123 |
11 | 138874520267a |
12 | 58239050452b |
13 | 248216031b90 |
14 | 10850ab81215 |
15 | 74c733d8468 |
hex | 3d71586d9f3 |
4222314011123 has 32 divisors (see below), whose sum is σ = 5101997544000. Its totient is φ = 3451864743936.
The previous prime is 4222314011107. The next prime is 4222314011129. The reversal of 4222314011123 is 3211104132224.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 4222314011123 - 24 = 4222314011107 is a prime.
It is a super-2 number, since 2×42223140111232 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4222314011092 and 4222314011101.
It is not an unprimeable number, because it can be changed into a prime (4222314011129) 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, 2748686 + ... + 3999987.
It is an arithmetic number, because the mean of its divisors is an integer number (159437423250).
Almost surely, 24222314011123 is an apocalyptic number.
4222314011123 is a deficient number, since it is larger than the sum of its proper divisors (879683532877).
4222314011123 is a wasteful number, since it uses less digits than its factorization.
4222314011123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6748871.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 4222314011123 its reverse (3211104132224), we get a palindrome (7433418143347).
The spelling of 4222314011123 in words is "four trillion, two hundred twenty-two billion, three hundred fourteen million, eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •