Base | Representation |
---|---|
bin | 110010010100011100… |
… | …011110011010011001 |
3 | 12011110110011110200022 |
4 | 302110130132122121 |
5 | 1341123201200441 |
6 | 40453204320225 |
7 | 3621626162534 |
oct | 622434363231 |
9 | 164413143608 |
10 | 54030100121 |
11 | 20a06645a08 |
12 | a57a6a3075 |
13 | 513099cb5a |
14 | 2887a7ba1b |
15 | 16135b384b |
hex | c9471e699 |
54030100121 has 2 divisors, whose sum is σ = 54030100122. Its totient is φ = 54030100120.
The previous prime is 54030100087. The next prime is 54030100171. The reversal of 54030100121 is 12100103045.
54030100121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 51529000000 + 2501100121 = 227000^2 + 50011^2 .
It is a cyclic number.
It is not a de Polignac number, because 54030100121 - 26 = 54030100057 is a prime.
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 54030100121.
It is not a weakly prime, because it can be changed into another prime (54030100171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27015050060 + 27015050061.
It is an arithmetic number, because the mean of its divisors is an integer number (27015050061).
Almost surely, 254030100121 is an apocalyptic number.
It is an amenable number.
54030100121 is a deficient number, since it is larger than the sum of its proper divisors (1).
54030100121 is an equidigital number, since it uses as much as digits as its factorization.
54030100121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 120, while the sum is 17.
Adding to 54030100121 its reverse (12100103045), we get a palindrome (66130203166).
The spelling of 54030100121 in words is "fifty-four billion, thirty million, one hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •