Base | Representation |
---|---|
bin | 111100010000111001100… |
… | …100011000010111010001 |
3 | 112122220110022111112021222 |
4 | 330100321210120113101 |
5 | 1020322402430433013 |
6 | 12450254334054425 |
7 | 605125425560552 |
oct | 74207144302721 |
9 | 15586408445258 |
10 | 4141314311633 |
11 | 1357359a68574 |
12 | 56a74594a415 |
13 | 2406a7a66905 |
14 | 104625336329 |
15 | 72ad2297508 |
hex | 3c4399185d1 |
4141314311633 has 2 divisors, whose sum is σ = 4141314311634. Its totient is φ = 4141314311632.
The previous prime is 4141314311593. The next prime is 4141314311663. The reversal of 4141314311633 is 3361134131414.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2429134210624 + 1712180101009 = 1558568^2 + 1308503^2 .
It is a cyclic number.
It is not a de Polignac number, because 4141314311633 - 26 = 4141314311569 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 4141314311593 and 4141314311602.
It is not a weakly prime, because it can be changed into another prime (4141314311663) 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, 2070657155816 + 2070657155817.
It is an arithmetic number, because the mean of its divisors is an integer number (2070657155817).
Almost surely, 24141314311633 is an apocalyptic number.
It is an amenable number.
4141314311633 is a deficient number, since it is larger than the sum of its proper divisors (1).
4141314311633 is an equidigital number, since it uses as much as digits as its factorization.
4141314311633 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 31104, while the sum is 35.
The spelling of 4141314311633 in words is "four trillion, one hundred forty-one billion, three hundred fourteen million, three hundred eleven thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •