Base | Representation |
---|---|
bin | 1111011000101… |
… | …01011001001000 |
3 | 22222212001102120 |
4 | 13230111121020 |
5 | 231014444342 |
6 | 20450131240 |
7 | 3125004300 |
oct | 754253110 |
9 | 288761376 |
10 | 129062472 |
11 | 66941600 |
12 | 37280b20 |
13 | 2097ab36 |
14 | 131d8600 |
15 | b4e5aec |
hex | 7b15648 |
129062472 has 144 divisors (see below), whose sum is σ = 413012880. Its totient is φ = 33485760.
The previous prime is 129062449. The next prime is 129062509. The reversal of 129062472 is 274260921.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 141843 + ... + 142749.
It is an arithmetic number, because the mean of its divisors is an integer number (2868145).
Almost surely, 2129062472 is an apocalyptic number.
129062472 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 129062472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (206506440).
129062472 is an abundant number, since it is smaller than the sum of its proper divisors (283950408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
129062472 is a wasteful number, since it uses less digits than its factorization.
129062472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 952 (or 930 counting only the distinct ones).
The product of its (nonzero) digits is 12096, while the sum is 33.
The square root of 129062472 is about 11360.5665351689. The cubic root of 129062472 is about 505.3589866530.
The spelling of 129062472 in words is "one hundred twenty-nine million, sixty-two thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •