Base | Representation |
---|---|
bin | 111010110100110010011… |
… | …111101101110000011110 |
3 | 112022110011121020001122222 |
4 | 322310302133231300132 |
5 | 1012212324304301342 |
6 | 12333020321305342 |
7 | 565024502651216 |
oct | 72646237556036 |
9 | 15273147201588 |
10 | 4042411400222 |
11 | 1319416939358 |
12 | 553543495252 |
13 | 234275628920 |
14 | dd921c97246 |
15 | 7024451aed2 |
hex | 3ad327edc1e |
4042411400222 has 8 divisors (see below), whose sum is σ = 6530049185016. Its totient is φ = 1865728338552.
The previous prime is 4042411400171. The next prime is 4042411400243. The reversal of 4042411400222 is 2220041142404.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (26), and also a Moran number because the ratio is a prime number: 155477361547 = 4042411400222 / (4 + 0 + 4 + 2 + 4 + 1 + 1 + 4 + 0 + 0 + 2 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 4042411400191 and 4042411400200.
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, 77738680748 + ... + 77738680799.
It is an arithmetic number, because the mean of its divisors is an integer number (816256148127).
Almost surely, 24042411400222 is an apocalyptic number.
4042411400222 is a deficient number, since it is larger than the sum of its proper divisors (2487637784794).
4042411400222 is a wasteful number, since it uses less digits than its factorization.
4042411400222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155477361562.
The product of its (nonzero) digits is 4096, while the sum is 26.
Adding to 4042411400222 its reverse (2220041142404), we get a palindrome (6262452542626).
The spelling of 4042411400222 in words is "four trillion, forty-two billion, four hundred eleven million, four hundred thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •