Base | Representation |
---|---|
bin | 111011101000011… |
… | …111001010100000 |
3 | 2120201120002200001 |
4 | 323220133022200 |
5 | 4022110003102 |
6 | 243135305344 |
7 | 33535563454 |
oct | 7350371240 |
9 | 2521502601 |
10 | 1000469152 |
11 | 473814311 |
12 | 23b07b254 |
13 | 12c3728a7 |
14 | 96c30664 |
15 | 5cc75487 |
hex | 3ba1f2a0 |
1000469152 has 12 divisors (see below), whose sum is σ = 1969673706. Its totient is φ = 500234560.
The previous prime is 1000469143. The next prime is 1000469177. The reversal of 1000469152 is 2519640001.
1000469152 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 731377936 + 269091216 = 27044^2 + 16404^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 1000469152.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15632299 + ... + 15632362.
Almost surely, 21000469152 is an apocalyptic number.
It is an amenable number.
1000469152 is a deficient number, since it is larger than the sum of its proper divisors (969204554).
1000469152 is an equidigital number, since it uses as much as digits as its factorization.
1000469152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31264671 (or 31264663 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 28.
The square root of 1000469152 is about 31630.1936762961. The cubic root of 1000469152 is about 1000.1563595504.
The spelling of 1000469152 in words is "one billion, four hundred sixty-nine thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •