Base | Representation |
---|---|
bin | 111101110000101111001… |
… | …111101010001001101011 |
3 | 120000202002000022111220111 |
4 | 331300233033222021223 |
5 | 1024014130400304121 |
6 | 13005433511035151 |
7 | 615430510332646 |
oct | 75605717521153 |
9 | 16022060274814 |
10 | 4244220322411 |
11 | 1396a667a8573 |
12 | 58668496bab7 |
13 | 24a2c763cc54 |
14 | 1095c82d4a5d |
15 | 756066ac2e1 |
hex | 3dc2f3ea26b |
4244220322411 has 8 divisors (see below), whose sum is σ = 4611716480000. Its totient is φ = 3891135778920.
The previous prime is 4244220322301. The next prime is 4244220322451. The reversal of 4244220322411 is 1142230224424.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4244220322411 - 29 = 4244220321899 is a prime.
It is a super-2 number, since 2×42442203224112 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is not an unprimeable number, because it can be changed into a prime (4244220322451) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3602902911 + ... + 3602904088.
It is an arithmetic number, because the mean of its divisors is an integer number (576464560000).
Almost surely, 24244220322411 is an apocalyptic number.
4244220322411 is a deficient number, since it is larger than the sum of its proper divisors (367496157589).
4244220322411 is a wasteful number, since it uses less digits than its factorization.
4244220322411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7205807049.
The product of its (nonzero) digits is 24576, while the sum is 31.
Adding to 4244220322411 its reverse (1142230224424), we get a palindrome (5386450546835).
The spelling of 4244220322411 in words is "four trillion, two hundred forty-four billion, two hundred twenty million, three hundred twenty-two thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •