Base | Representation |
---|---|
bin | 11011001001001… |
… | …101101011000101 |
3 | 1011201220201112121 |
4 | 123021031223011 |
5 | 1413040301013 |
6 | 113104445541 |
7 | 14166560116 |
oct | 3311155305 |
9 | 1151821477 |
10 | 455400133 |
11 | 214074951 |
12 | 1086198b1 |
13 | 7346a946 |
14 | 446a620d |
15 | 29ea858d |
hex | 1b24dac5 |
455400133 has 2 divisors, whose sum is σ = 455400134. Its totient is φ = 455400132.
The previous prime is 455400109. The next prime is 455400247. The reversal of 455400133 is 331004554.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 422014849 + 33385284 = 20543^2 + 5778^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-455400133 is a prime.
It is a super-3 number, since 3×4554001333 (a number of 27 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 455400098 and 455400107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (455400103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 227700066 + 227700067.
It is an arithmetic number, because the mean of its divisors is an integer number (227700067).
Almost surely, 2455400133 is an apocalyptic number.
It is an amenable number.
455400133 is a deficient number, since it is larger than the sum of its proper divisors (1).
455400133 is an equidigital number, since it uses as much as digits as its factorization.
455400133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 25.
The square root of 455400133 is about 21340.1062087329. The cubic root of 455400133 is about 769.3625651613.
Adding to 455400133 its reverse (331004554), we get a palindrome (786404687).
The spelling of 455400133 in words is "four hundred fifty-five million, four hundred thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •