Base | Representation |
---|---|
bin | 1001011100001000… |
… | …01000010000110101 |
3 | 111002011221222221112 |
4 | 10232010020100311 |
5 | 40334324123103 |
6 | 2154512324405 |
7 | 236404413635 |
oct | 45604102065 |
9 | 14064858845 |
10 | 5067801653 |
11 | 2170707432 |
12 | b95243705 |
13 | 629c0a905 |
14 | 3610b06c5 |
15 | 1e9d9acd8 |
hex | 12e108435 |
5067801653 has 2 divisors, whose sum is σ = 5067801654. Its totient is φ = 5067801652.
The previous prime is 5067801631. The next prime is 5067801667. The reversal of 5067801653 is 3561087605.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4176002884 + 891798769 = 64622^2 + 29863^2 .
It is a cyclic number.
It is not a de Polignac number, because 5067801653 - 28 = 5067801397 is a prime.
It is a super-2 number, since 2×50678016532 = 51365227188299064818, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 5067801653.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5067800653) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2533900826 + 2533900827.
It is an arithmetic number, because the mean of its divisors is an integer number (2533900827).
Almost surely, 25067801653 is an apocalyptic number.
It is an amenable number.
5067801653 is a deficient number, since it is larger than the sum of its proper divisors (1).
5067801653 is an equidigital number, since it uses as much as digits as its factorization.
5067801653 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 151200, while the sum is 41.
The square root of 5067801653 is about 71188.4938244939. The cubic root of 5067801653 is about 1717.6705500429.
The spelling of 5067801653 in words is "five billion, sixty-seven million, eight hundred one thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •