Base | Representation |
---|---|
bin | 11000001010111010000001… |
… | …00110001010010001000111 |
3 | 20222012012210202122210221001 |
4 | 30011131000212022101013 |
5 | 23431312332313031401 |
6 | 305013212203234131 |
7 | 14124024601636036 |
oct | 1405350046122107 |
9 | 228165722583831 |
10 | 53151304033351 |
11 | 15a32383525527 |
12 | 5b650b4218947 |
13 | 23871b9a200a4 |
14 | d1a77314271d |
15 | 6228c26bd601 |
hex | 30574098a447 |
53151304033351 has 2 divisors, whose sum is σ = 53151304033352. Its totient is φ = 53151304033350.
The previous prime is 53151304033319. The next prime is 53151304033357. The reversal of 53151304033351 is 15333040315135.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 53151304033351 - 25 = 53151304033319 is a prime.
It is a super-2 number, since 2×531513040333512 (a number of 28 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 53151304033351.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53151304033357) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26575652016675 + 26575652016676.
It is an arithmetic number, because the mean of its divisors is an integer number (26575652016676).
Almost surely, 253151304033351 is an apocalyptic number.
53151304033351 is a deficient number, since it is larger than the sum of its proper divisors (1).
53151304033351 is an equidigital number, since it uses as much as digits as its factorization.
53151304033351 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 121500, while the sum is 37.
Adding to 53151304033351 its reverse (15333040315135), we get a palindrome (68484344348486).
The spelling of 53151304033351 in words is "fifty-three trillion, one hundred fifty-one billion, three hundred four million, thirty-three thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •