Base | Representation |
---|---|
bin | 11011111101101… |
… | …011000110010001 |
3 | 1012200210101202101 |
4 | 123331223012101 |
5 | 1430100332040 |
6 | 114315320401 |
7 | 14424504340 |
oct | 3375530621 |
9 | 1180711671 |
10 | 469152145 |
11 | 220907a50 |
12 | 111150101 |
13 | 76274227 |
14 | 46445b57 |
15 | 2b2c309a |
hex | 1bf6b191 |
469152145 has 64 divisors (see below), whose sum is σ = 760928256. Its totient is φ = 268692480.
The previous prime is 469152139. The next prime is 469152149. The reversal of 469152145 is 541251964.
It is not a de Polignac number, because 469152145 - 25 = 469152113 is a prime.
It is not an unprimeable number, because it can be changed into a prime (469152149) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 280602 + ... + 282268.
It is an arithmetic number, because the mean of its divisors is an integer number (11889504).
Almost surely, 2469152145 is an apocalyptic number.
It is an amenable number.
469152145 is a deficient number, since it is larger than the sum of its proper divisors (291776111).
469152145 is a wasteful number, since it uses less digits than its factorization.
469152145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1750.
The product of its digits is 43200, while the sum is 37.
The square root of 469152145 is about 21659.9202445438. The cubic root of 469152145 is about 777.0302066397.
The spelling of 469152145 in words is "four hundred sixty-nine million, one hundred fifty-two thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •