Base | Representation |
---|---|
bin | 11101000111011010010… |
… | …01010001101001000101 |
3 | 10112122020100212122102111 |
4 | 32203231021101221011 |
5 | 112342320211410141 |
6 | 2043325452341021 |
7 | 132164055400165 |
oct | 16435511215105 |
9 | 3478210778374 |
10 | 1000411044421 |
11 | 3562a9a54728 |
12 | 141a77774771 |
13 | 734524a61a9 |
14 | 365c4c845a5 |
15 | 1b0528ac381 |
hex | e8ed251a45 |
1000411044421 has 2 divisors, whose sum is σ = 1000411044422. Its totient is φ = 1000411044420.
The previous prime is 1000411044401. The next prime is 1000411044427. The reversal of 1000411044421 is 1244401140001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 542637016321 + 457774028100 = 736639^2 + 676590^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000411044421 - 29 = 1000411043909 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1000411044392 and 1000411044401.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1000411044427) 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 as a sum of consecutive naturals, namely, 500205522210 + 500205522211.
It is an arithmetic number, because the mean of its divisors is an integer number (500205522211).
Almost surely, 21000411044421 is an apocalyptic number.
It is an amenable number.
1000411044421 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000411044421 is an equidigital number, since it uses as much as digits as its factorization.
1000411044421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 512, while the sum is 22.
Adding to 1000411044421 its reverse (1244401140001), we get a palindrome (2244812184422).
The spelling of 1000411044421 in words is "one trillion, four hundred eleven million, forty-four thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •