Base | Representation |
---|---|
bin | 10100101110011001100… |
… | …110111101000001011001 |
3 | 12001011010201211021220000 |
4 | 110232121212331001121 |
5 | 141313241043103231 |
6 | 3010135034523213 |
7 | 204616166211546 |
oct | 24563146750131 |
9 | 5034121737800 |
10 | 1424211300441 |
11 | 4aa0061716a6 |
12 | 1b0031596509 |
13 | a43c1915c57 |
14 | 4cd09d29bcd |
15 | 270a898d6e6 |
hex | 14b999bd059 |
1424211300441 has 10 divisors (see below), whose sum is σ = 2127525523002. Its totient is φ = 949474200240.
The previous prime is 1424211300401. The next prime is 1424211300487. The reversal of 1424211300441 is 1440031124241.
1424211300441 is a `hidden beast` number, since 1 + 4 + 2 + 4 + 211 + 3 + 0 + 0 + 441 = 666.
It can be written as a sum of positive squares in only one way, i.e., 1029078369225 + 395132931216 = 1014435^2 + 628596^2 .
It is not a de Polignac number, because 1424211300441 - 215 = 1424211267673 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (1424211300401) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 8791427700 + ... + 8791427861.
Almost surely, 21424211300441 is an apocalyptic number.
It is an amenable number.
1424211300441 is a deficient number, since it is larger than the sum of its proper divisors (703314222561).
1424211300441 is an equidigital number, since it uses as much as digits as its factorization.
1424211300441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17582855573 (or 17582855564 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
Adding to 1424211300441 its reverse (1440031124241), we get a palindrome (2864242424682).
The spelling of 1424211300441 in words is "one trillion, four hundred twenty-four billion, two hundred eleven million, three hundred thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •