Base | Representation |
---|---|
bin | 111101111110010001111111… |
… | …0000001100100011000010001 |
3 | 2122111010002220101001210100021 |
4 | 1323330203332001210120101 |
5 | 1032422232323311013322 |
6 | 5211213210501423441 |
7 | 222551505134513221 |
oct | 17374437601443021 |
9 | 2574102811053307 |
10 | 545121511032337 |
11 | 148768809764478 |
12 | 5118024b10ab81 |
13 | 1a522979292735 |
14 | 988804419a081 |
15 | 4304cdc7ba4c7 |
hex | 1efc8fe064611 |
545121511032337 has 2 divisors, whose sum is σ = 545121511032338. Its totient is φ = 545121511032336.
The previous prime is 545121511032229. The next prime is 545121511032353. The reversal of 545121511032337 is 733230115121545.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 538989667254801 + 6131843777536 = 23216151^2 + 2476256^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-545121511032337 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 545121511032293 and 545121511032302.
It is not a weakly prime, because it can be changed into another prime (545121511032367) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 272560755516168 + 272560755516169.
It is an arithmetic number, because the mean of its divisors is an integer number (272560755516169).
Almost surely, 2545121511032337 is an apocalyptic number.
It is an amenable number.
545121511032337 is a deficient number, since it is larger than the sum of its proper divisors (1).
545121511032337 is an equidigital number, since it uses as much as digits as its factorization.
545121511032337 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 378000, while the sum is 43.
The spelling of 545121511032337 in words is "five hundred forty-five trillion, one hundred twenty-one billion, five hundred eleven million, thirty-two thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •