Base | Representation |
---|---|
bin | 1111011000101… |
… | …10000011000000 |
3 | 22222212012002211 |
4 | 13230112003000 |
5 | 231020041102 |
6 | 20450151504 |
7 | 3125015146 |
oct | 754260300 |
9 | 288765084 |
10 | 129065152 |
11 | 66943617 |
12 | 37282594 |
13 | 2097c118 |
14 | 131d9596 |
15 | b4e67d7 |
hex | 7b160c0 |
129065152 has 28 divisors (see below), whose sum is σ = 264379456. Its totient is φ = 62449920.
The previous prime is 129065137. The next prime is 129065159. The reversal of 129065152 is 251560921.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is not an unprimeable number, because it can be changed into a prime (129065159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30543 + ... + 34510.
Almost surely, 2129065152 is an apocalyptic number.
It is an amenable number.
129065152 is an abundant number, since it is smaller than the sum of its proper divisors (135314304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
129065152 is an equidigital number, since it uses as much as digits as its factorization.
129065152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65096 (or 65086 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 31.
The square root of 129065152 is about 11360.6844864207. The cubic root of 129065152 is about 505.3624845784.
The spelling of 129065152 in words is "one hundred twenty-nine million, sixty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •