Base | Representation |
---|---|
bin | 11100111010101… |
… | …101101011110110 |
3 | 1020210220100112010 |
4 | 130322231223312 |
5 | 1443144403101 |
6 | 120050305050 |
7 | 15010510524 |
oct | 3472555366 |
9 | 1223810463 |
10 | 485153526 |
11 | 229947030 |
12 | 116588186 |
13 | 796875c0 |
14 | 4860d314 |
15 | 2c8d42d6 |
hex | 1ceadaf6 |
485153526 has 64 divisors (see below), whose sum is σ = 1147265280. Its totient is φ = 134835840.
The previous prime is 485153483. The next prime is 485153527. The reversal of 485153526 is 625351584.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (485153527) 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 31 ways as a sum of consecutive naturals, for example, 138120 + ... + 141588.
It is an arithmetic number, because the mean of its divisors is an integer number (17926020).
Almost surely, 2485153526 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 485153526, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (573632640).
485153526 is an abundant number, since it is smaller than the sum of its proper divisors (662111754).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
485153526 is a wasteful number, since it uses less digits than its factorization.
485153526 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3661.
The product of its digits is 144000, while the sum is 39.
The square root of 485153526 is about 22026.2008980214. The cubic root of 485153526 is about 785.7656942640.
The spelling of 485153526 in words is "four hundred eighty-five million, one hundred fifty-three thousand, five hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •