Base | Representation |
---|---|
bin | 111011110110101000100… |
… | …010000101111111110110 |
3 | 112120012122210101121212010 |
4 | 323312220202011333312 |
5 | 1014342122432241042 |
6 | 12425312011505050 |
7 | 603106505306421 |
oct | 73665042057766 |
9 | 15505583347763 |
10 | 4113111212022 |
11 | 13463a706138a |
12 | 565194758186 |
13 | 23ab31a47aa7 |
14 | 10310b7d89b8 |
15 | 71ed12b359c |
hex | 3bda8885ff6 |
4113111212022 has 8 divisors (see below), whose sum is σ = 8226222424056. Its totient is φ = 1371037070672.
The previous prime is 4113111211969. The next prime is 4113111212033. The reversal of 4113111212022 is 2202121113114.
It is a sphenic number, since it is the product of 3 distinct primes.
4113111212022 is an admirable number.
It is a super-2 number, since 2×41131112120222 (a number of 26 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 4113111212022.
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, 342759267663 + ... + 342759267674.
It is an arithmetic number, because the mean of its divisors is an integer number (1028277803007).
Almost surely, 24113111212022 is an apocalyptic number.
4113111212022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4113111212022 is a wasteful number, since it uses less digits than its factorization.
4113111212022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 685518535342.
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 4113111212022 its reverse (2202121113114), we get a palindrome (6315232325136).
The spelling of 4113111212022 in words is "four trillion, one hundred thirteen billion, one hundred eleven million, two hundred twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •