Base | Representation |
---|---|
bin | 1000011111000011… |
… | …10111111100100101 |
3 | 102202110222122122220 |
4 | 10033201313330211 |
5 | 33312202133240 |
6 | 2032012142553 |
7 | 220614104661 |
oct | 41741677445 |
9 | 12673878586 |
10 | 4555505445 |
11 | 1a28511737 |
12 | a71767a59 |
13 | 577a3ba6a |
14 | 3130378a1 |
15 | 1b9e045d0 |
hex | 10f877f25 |
4555505445 has 16 divisors (see below), whose sum is σ = 7292799360. Its totient is φ = 2428272704.
The previous prime is 4555505443. The next prime is 4555505447. The reversal of 4555505445 is 5445055554.
It is an interprime number because it is at equal distance from previous prime (4555505443) and next prime (4555505447).
It is a cyclic number.
It is not a de Polignac number, because 4555505445 - 21 = 4555505443 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4555505397 and 4555505406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4555505443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 54510 + ... + 109919.
It is an arithmetic number, because the mean of its divisors is an integer number (455799960).
Almost surely, 24555505445 is an apocalyptic number.
It is an amenable number.
4555505445 is a deficient number, since it is larger than the sum of its proper divisors (2737293915).
4555505445 is a wasteful number, since it uses less digits than its factorization.
4555505445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166284.
The product of its (nonzero) digits is 1000000, while the sum is 42.
The square root of 4555505445 is about 67494.4845524432. The cubic root of 4555505445 is about 1657.7238661248.
The spelling of 4555505445 in words is "four billion, five hundred fifty-five million, five hundred five thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •