Base | Representation |
---|---|
bin | 100101011110101001101… |
… | …1000000011001101101101 |
3 | 200020102210112210222221012 |
4 | 1022331103120003031231 |
5 | 1133343340014221303 |
6 | 14542211051115005 |
7 | 1041103116454541 |
oct | 112752330031555 |
9 | 20212715728835 |
10 | 5151064601453 |
11 | 1706610752521 |
12 | 6b2389142a65 |
13 | 2b498807c0c4 |
14 | 13b45469da21 |
15 | 8dece9e35d8 |
hex | 4af5360336d |
5151064601453 has 2 divisors, whose sum is σ = 5151064601454. Its totient is φ = 5151064601452.
The previous prime is 5151064601443. The next prime is 5151064601567. The reversal of 5151064601453 is 3541064601515.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5142386188489 + 8678412964 = 2267683^2 + 93158^2 .
It is a cyclic number.
It is not a de Polignac number, because 5151064601453 - 232 = 5146769634157 is a prime.
It is a super-2 number, since 2×51510646014532 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5151064601453.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5151064601443) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2575532300726 + 2575532300727.
It is an arithmetic number, because the mean of its divisors is an integer number (2575532300727).
Almost surely, 25151064601453 is an apocalyptic number.
It is an amenable number.
5151064601453 is a deficient number, since it is larger than the sum of its proper divisors (1).
5151064601453 is an equidigital number, since it uses as much as digits as its factorization.
5151064601453 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216000, while the sum is 41.
The spelling of 5151064601453 in words is "five trillion, one hundred fifty-one billion, sixty-four million, six hundred one thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •