Base | Representation |
---|---|
bin | 1011101100111100001… |
… | …0011100010001011001 |
3 | 201012220222000202102011 |
4 | 2323033002130101121 |
5 | 11243213224110132 |
6 | 232205112105521 |
7 | 20345002653331 |
oct | 2731702342131 |
9 | 635828022364 |
10 | 201042019417 |
11 | 78296a84878 |
12 | 32b686952a1 |
13 | 15c5c17c105 |
14 | 9a3264a0c1 |
15 | 5369ba5b47 |
hex | 2ecf09c459 |
201042019417 has 2 divisors, whose sum is σ = 201042019418. Its totient is φ = 201042019416.
The previous prime is 201042019411. The next prime is 201042019421. The reversal of 201042019417 is 714910240102.
201042019417 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 148058726656 + 52983292761 = 384784^2 + 230181^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201042019417 is a prime.
It is not a weakly prime, because it can be changed into another prime (201042019411) 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, 100521009708 + 100521009709.
It is an arithmetic number, because the mean of its divisors is an integer number (100521009709).
Almost surely, 2201042019417 is an apocalyptic number.
It is an amenable number.
201042019417 is a deficient number, since it is larger than the sum of its proper divisors (1).
201042019417 is an equidigital number, since it uses as much as digits as its factorization.
201042019417 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4032, while the sum is 31.
Adding to 201042019417 its reverse (714910240102), we get a palindrome (915952259519).
The spelling of 201042019417 in words is "two hundred one billion, forty-two million, nineteen thousand, four hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •