Base | Representation |
---|---|
bin | 11011001001011… |
… | …011100100011101 |
3 | 1011202000121121202 |
4 | 123021123210131 |
5 | 1413044111203 |
6 | 113110005245 |
7 | 14200215062 |
oct | 3311334435 |
9 | 1152017552 |
10 | 455457053 |
11 | 214103697 |
12 | 108646825 |
13 | 7348a81c |
14 | 446bcc69 |
15 | 29eba388 |
hex | 1b25b91d |
455457053 has 4 divisors (see below), whose sum is σ = 470149248. Its totient is φ = 440764860.
The previous prime is 455457043. The next prime is 455457103. The reversal of 455457053 is 350754554.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 455457053 - 212 = 455452957 is a prime.
It is a super-2 number, since 2×4554570532 = 414882254254889618, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 455456998 and 455457016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (455457043) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7346051 + ... + 7346112.
It is an arithmetic number, because the mean of its divisors is an integer number (117537312).
Almost surely, 2455457053 is an apocalyptic number.
It is an amenable number.
455457053 is a deficient number, since it is larger than the sum of its proper divisors (14692195).
455457053 is a wasteful number, since it uses less digits than its factorization.
455457053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14692194.
The product of its (nonzero) digits is 210000, while the sum is 38.
The square root of 455457053 is about 21341.4398061612. The cubic root of 455457053 is about 769.3946177745.
The spelling of 455457053 in words is "four hundred fifty-five million, four hundred fifty-seven thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •