Base | Representation |
---|---|
bin | 11011001001101… |
… | …111100101101010 |
3 | 1011202011210002200 |
4 | 123021233211222 |
5 | 1413104222200 |
6 | 113111441030 |
7 | 14201006121 |
oct | 3311574552 |
9 | 1152153080 |
10 | 455539050 |
11 | 21415a25a |
12 | 108686176 |
13 | 734b8c45 |
14 | 44700ab8 |
15 | 29ed4800 |
hex | 1b26f96a |
455539050 has 72 divisors (see below), whose sum is σ = 1227570240. Its totient is φ = 121111200.
The previous prime is 455539039. The next prime is 455539061. The reversal of 455539050 is 50935554.
It is an interprime number because it is at equal distance from previous prime (455539039) and next prime (455539061).
It is a junction number, because it is equal to n+sod(n) for n = 455538996 and 455539014.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 169215 + ... + 171885.
Almost surely, 2455539050 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 455539050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (613785120).
455539050 is an abundant number, since it is smaller than the sum of its proper divisors (772031190).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
455539050 is a wasteful number, since it uses less digits than its factorization.
455539050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3068 (or 3060 counting only the distinct ones).
The product of its (nonzero) digits is 67500, while the sum is 36.
The square root of 455539050 is about 21343.3607944016. The cubic root of 455539050 is about 769.4407869756.
The spelling of 455539050 in words is "four hundred fifty-five million, five hundred thirty-nine thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •