Base | Representation |
---|---|
bin | 11000100101000110010011… |
… | …01011001111111000000101 |
3 | 21002101020201200112212020011 |
4 | 30102203021223033320011 |
5 | 24041033431003314001 |
6 | 310542445151510221 |
7 | 14246034261345334 |
oct | 1422431153177005 |
9 | 232336650485204 |
10 | 54051252010501 |
11 | 1624a009712829 |
12 | 608b5b2b28371 |
13 | 242101b793135 |
14 | d4c147665d1b |
15 | 63aee5370d51 |
hex | 3128c9acfe05 |
54051252010501 has 2 divisors, whose sum is σ = 54051252010502. Its totient is φ = 54051252010500.
The previous prime is 54051252010423. The next prime is 54051252010517. The reversal of 54051252010501 is 10501025215045.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 52431356902500 + 1619895108001 = 7240950^2 + 1272751^2 .
It is a cyclic number.
It is not a de Polignac number, because 54051252010501 - 239 = 53501496196613 is a prime.
It is a super-2 number, since 2×540512520105012 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (54051252010601) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27025626005250 + 27025626005251.
It is an arithmetic number, because the mean of its divisors is an integer number (27025626005251).
Almost surely, 254051252010501 is an apocalyptic number.
It is an amenable number.
54051252010501 is a deficient number, since it is larger than the sum of its proper divisors (1).
54051252010501 is an equidigital number, since it uses as much as digits as its factorization.
54051252010501 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10000, while the sum is 31.
Adding to 54051252010501 its reverse (10501025215045), we get a palindrome (64552277225546).
The spelling of 54051252010501 in words is "fifty-four trillion, fifty-one billion, two hundred fifty-two million, ten thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •