Base | Representation |
---|---|
bin | 10100111110000100100… |
… | …010101110100011010001 |
3 | 12002202120101201222222002 |
4 | 110332010202232203101 |
5 | 142102221130141431 |
6 | 3022000435523345 |
7 | 206053154455421 |
oct | 24760442564321 |
9 | 5082511658862 |
10 | 1441037740241 |
11 | 5061602669a0 |
12 | 1b3348759555 |
13 | a5b7397b6c8 |
14 | 4da6494a481 |
15 | 27740cd03cb |
hex | 14f848ae8d1 |
1441037740241 has 32 divisors (see below), whose sum is σ = 1631251155072. Its totient is φ = 1261563932160.
The previous prime is 1441037740231. The next prime is 1441037740273. The reversal of 1441037740241 is 1420477301441.
It is a cyclic number.
It is not a de Polignac number, because 1441037740241 - 226 = 1440970631377 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1441037740195 and 1441037740204.
It is not an unprimeable number, because it can be changed into a prime (1441037740201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 116460131 + ... + 116472503.
It is an arithmetic number, because the mean of its divisors is an integer number (50976598596).
Almost surely, 21441037740241 is an apocalyptic number.
1441037740241 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1441037740241 is a deficient number, since it is larger than the sum of its proper divisors (190213414831).
1441037740241 is a wasteful number, since it uses less digits than its factorization.
1441037740241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15873.
The product of its (nonzero) digits is 75264, while the sum is 38.
The spelling of 1441037740241 in words is "one trillion, four hundred forty-one billion, thirty-seven million, seven hundred forty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •