Base | Representation |
---|---|
bin | 1011111110011011100… |
… | …10100111011010100001 |
3 | 1110100002100211220120111 |
4 | 11333031302213122201 |
5 | 23220144432203131 |
6 | 513010114211321 |
7 | 41504502315445 |
oct | 5771562473241 |
9 | 1410070756514 |
10 | 411474491041 |
11 | 149561694349 |
12 | 678b5b83b41 |
13 | 2ca56959003 |
14 | 15cb60a8825 |
15 | aa83e62ab1 |
hex | 5fcdca76a1 |
411474491041 has 2 divisors, whose sum is σ = 411474491042. Its totient is φ = 411474491040.
The previous prime is 411474491011. The next prime is 411474491053. The reversal of 411474491041 is 140194474114.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 269719229025 + 141755262016 = 519345^2 + 376504^2 .
It is a cyclic number.
It is not a de Polignac number, because 411474491041 - 211 = 411474488993 is a prime.
It is a super-2 number, since 2×4114744910412 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 411474490985 and 411474491003.
It is not a weakly prime, because it can be changed into another prime (411474491011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 205737245520 + 205737245521.
It is an arithmetic number, because the mean of its divisors is an integer number (205737245521).
Almost surely, 2411474491041 is an apocalyptic number.
It is an amenable number.
411474491041 is a deficient number, since it is larger than the sum of its proper divisors (1).
411474491041 is an equidigital number, since it uses as much as digits as its factorization.
411474491041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64512, while the sum is 40.
The spelling of 411474491041 in words is "four hundred eleven billion, four hundred seventy-four million, four hundred ninety-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •