Base | Representation |
---|---|
bin | 1001010010000110011101… |
… | …10100100001000100100001 |
3 | 2200021110220211110212221011 |
4 | 10221003032310201010201 |
5 | 10133422120020322113 |
6 | 111225401304100521 |
7 | 4204541666021662 |
oct | 451031664410441 |
9 | 80243824425834 |
10 | 20413154464033 |
11 | 6560196585a11 |
12 | 2358258164741 |
13 | b50c4bcc67b6 |
14 | 5080054b7369 |
15 | 255ed654363d |
hex | 1290ced21121 |
20413154464033 has 2 divisors, whose sum is σ = 20413154464034. Its totient is φ = 20413154464032.
The previous prime is 20413154464009. The next prime is 20413154464037. The reversal of 20413154464033 is 33046445131402.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18629038602769 + 1784115861264 = 4316137^2 + 1335708^2 .
It is a cyclic number.
It is not a de Polignac number, because 20413154464033 - 29 = 20413154463521 is a prime.
It is not a weakly prime, because it can be changed into another prime (20413154464037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10206577232016 + 10206577232017.
It is an arithmetic number, because the mean of its divisors is an integer number (10206577232017).
Almost surely, 220413154464033 is an apocalyptic number.
It is an amenable number.
20413154464033 is a deficient number, since it is larger than the sum of its proper divisors (1).
20413154464033 is an equidigital number, since it uses as much as digits as its factorization.
20413154464033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 414720, while the sum is 40.
Adding to 20413154464033 its reverse (33046445131402), we get a palindrome (53459599595435).
The spelling of 20413154464033 in words is "twenty trillion, four hundred thirteen billion, one hundred fifty-four million, four hundred sixty-four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.168 sec. • engine limits •