Base | Representation |
---|---|
bin | 111010010111101010000… |
… | …111111001000011100110 |
3 | 112012110102201022110022210 |
4 | 322113222013321003212 |
5 | 1011204244400040142 |
6 | 12310404440304250 |
7 | 562536413025024 |
oct | 72275207710346 |
9 | 15173381273283 |
10 | 4011132424422 |
11 | 1307125757932 |
12 | 549474172086 |
13 | 23132c2aa216 |
14 | dc1d5a41714 |
15 | 6e5134a649c |
hex | 3a5ea1f90e6 |
4011132424422 has 8 divisors (see below), whose sum is σ = 8022264848856. Its totient is φ = 1337044141472.
The previous prime is 4011132424417. The next prime is 4011132424451. The reversal of 4011132424422 is 2244242311104.
It is a sphenic number, since it is the product of 3 distinct primes.
4011132424422 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 4011132424422.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 334261035363 + ... + 334261035374.
It is an arithmetic number, because the mean of its divisors is an integer number (1002783106107).
Almost surely, 24011132424422 is an apocalyptic number.
4011132424422 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.
4011132424422 is a wasteful number, since it uses less digits than its factorization.
4011132424422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 668522070742.
The product of its (nonzero) digits is 12288, while the sum is 30.
Adding to 4011132424422 its reverse (2244242311104), we get a palindrome (6255374735526).
The spelling of 4011132424422 in words is "four trillion, eleven billion, one hundred thirty-two million, four hundred twenty-four thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •