Base | Representation |
---|---|
bin | 11101001110100000101… |
… | …00100110111110110001 |
3 | 10120000001222200202222011 |
4 | 32213100110212332301 |
5 | 112423121421142231 |
6 | 2045200004042521 |
7 | 132360365633530 |
oct | 16472024467661 |
9 | 3500058622864 |
10 | 1004222443441 |
11 | 357985431178 |
12 | 142760093441 |
13 | 7390c001b99 |
14 | 36867142317 |
15 | 1b1c72ca9b1 |
hex | e9d0526fb1 |
1004222443441 has 8 divisors (see below), whose sum is σ = 1197582044544. Its totient is φ = 823337655360.
The previous prime is 1004222443309. The next prime is 1004222443457. The reversal of 1004222443441 is 1443442224001.
It is a happy number.
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 1004222443441 - 227 = 1004088225713 is a prime.
It is a super-2 number, since 2×10042224434412 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1004222443141) 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, 3118703080 + ... + 3118703401.
It is an arithmetic number, because the mean of its divisors is an integer number (149697755568).
Almost surely, 21004222443441 is an apocalyptic number.
It is an amenable number.
1004222443441 is a deficient number, since it is larger than the sum of its proper divisors (193359601103).
1004222443441 is an equidigital number, since it uses as much as digits as its factorization.
1004222443441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6237406511.
The product of its (nonzero) digits is 24576, while the sum is 31.
Adding to 1004222443441 its reverse (1443442224001), we get a palindrome (2447664667442).
The spelling of 1004222443441 in words is "one trillion, four billion, two hundred twenty-two million, four hundred forty-three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •