Base | Representation |
---|---|
bin | 100000010100000111010… |
… | …1010001011000100100001 |
3 | 120201120121210120212101201 |
4 | 1000220032222023010201 |
5 | 1040231130440323411 |
6 | 13240140052001201 |
7 | 635604056102335 |
oct | 100501652130441 |
9 | 16646553525351 |
10 | 4441242120481 |
11 | 146257a437561 |
12 | 5b88ab000201 |
13 | 262a6593a55a |
14 | 114d58a457c5 |
15 | 7a7d84463c1 |
hex | 40a0ea8b121 |
4441242120481 has 2 divisors, whose sum is σ = 4441242120482. Its totient is φ = 4441242120480.
The previous prime is 4441242120457. The next prime is 4441242120487. The reversal of 4441242120481 is 1840212421444.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3027568680081 + 1413673440400 = 1739991^2 + 1188980^2 .
It is a cyclic number.
It is not a de Polignac number, because 4441242120481 - 29 = 4441242119969 is a prime.
It is a super-2 number, since 2×44412421204812 (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 4441242120481.
It is not a weakly prime, because it can be changed into another prime (4441242120487) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2220621060240 + 2220621060241.
It is an arithmetic number, because the mean of its divisors is an integer number (2220621060241).
Almost surely, 24441242120481 is an apocalyptic number.
It is an amenable number.
4441242120481 is a deficient number, since it is larger than the sum of its proper divisors (1).
4441242120481 is an equidigital number, since it uses as much as digits as its factorization.
4441242120481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 65536, while the sum is 37.
The spelling of 4441242120481 in words is "four trillion, four hundred forty-one billion, two hundred forty-two million, one hundred twenty thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •