Base | Representation |
---|---|
bin | 1000111101111001101… |
… | …0011011010111000001 |
3 | 112201122101021101010021 |
4 | 2033132122123113001 |
5 | 10011001130400441 |
6 | 154434432133441 |
7 | 14062430441365 |
oct | 2173632332701 |
9 | 481571241107 |
10 | 154055325121 |
11 | 5a37523aa15 |
12 | 25a34997281 |
13 | 116b17a2019 |
14 | 76561c72a5 |
15 | 4019b323d1 |
hex | 23de69b5c1 |
154055325121 has 2 divisors, whose sum is σ = 154055325122. Its totient is φ = 154055325120.
The previous prime is 154055325103. The next prime is 154055325211. The reversal of 154055325121 is 121523550451.
Together with next prime (154055325211) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 149236188721 + 4819136400 = 386311^2 + 69420^2 .
It is a cyclic number.
It is not a de Polignac number, because 154055325121 - 25 = 154055325089 is a prime.
It is not a weakly prime, because it can be changed into another prime (154055328121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 77027662560 + 77027662561.
It is an arithmetic number, because the mean of its divisors is an integer number (77027662561).
Almost surely, 2154055325121 is an apocalyptic number.
It is an amenable number.
154055325121 is a deficient number, since it is larger than the sum of its proper divisors (1).
154055325121 is an equidigital number, since it uses as much as digits as its factorization.
154055325121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30000, while the sum is 34.
Adding to 154055325121 its reverse (121523550451), we get a palindrome (275578875572).
The spelling of 154055325121 in words is "one hundred fifty-four billion, fifty-five million, three hundred twenty-five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •