Base | Representation |
---|---|
bin | 1101001111100101000… |
… | …11101101100101110101 |
3 | 1121111112120221120222211 |
4 | 12213302203231211311 |
5 | 24423410444423013 |
6 | 545013140053421 |
7 | 44606224541656 |
oct | 6476243554565 |
9 | 1544476846884 |
10 | 455041014133 |
11 | 165a88875a32 |
12 | 74234394271 |
13 | 33baa899c64 |
14 | 1804a1cd52d |
15 | bc83ae723d |
hex | 69f28ed975 |
455041014133 has 2 divisors, whose sum is σ = 455041014134. Its totient is φ = 455041014132.
The previous prime is 455041014089. The next prime is 455041014167. The reversal of 455041014133 is 331410140554.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 326992979889 + 128048034244 = 571833^2 + 357838^2 .
It is a cyclic number.
It is not a de Polignac number, because 455041014133 - 217 = 455040883061 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 455041014095 and 455041014104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (455041114133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 227520507066 + 227520507067.
It is an arithmetic number, because the mean of its divisors is an integer number (227520507067).
Almost surely, 2455041014133 is an apocalyptic number.
It is an amenable number.
455041014133 is a deficient number, since it is larger than the sum of its proper divisors (1).
455041014133 is an equidigital number, since it uses as much as digits as its factorization.
455041014133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 455041014133 its reverse (331410140554), we get a palindrome (786451154687).
The spelling of 455041014133 in words is "four hundred fifty-five billion, forty-one million, fourteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •