Base | Representation |
---|---|
bin | 1111011101010… |
… | …10100100010000 |
3 | 100001000002120210 |
4 | 13232222210100 |
5 | 231144022423 |
6 | 20511204120 |
7 | 3133130550 |
oct | 756524420 |
9 | 301002523 |
10 | 129673488 |
11 | 6721967a |
12 | 37516640 |
13 | 20b32c99 |
14 | 13317160 |
15 | b5b6b93 |
hex | 7baa910 |
129673488 has 80 divisors (see below), whose sum is σ = 392224896. Its totient is φ = 36142080.
The previous prime is 129673487. The next prime is 129673519. The reversal of 129673488 is 884376921.
It is a super-2 number, since 2×1296734882 = 33630426980172288, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (129673483) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 9070 + ... + 18482.
Almost surely, 2129673488 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 129673488, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (196112448).
129673488 is an abundant number, since it is smaller than the sum of its proper divisors (262551408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
129673488 is a wasteful number, since it uses less digits than its factorization.
129673488 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9472 (or 9466 counting only the distinct ones).
The product of its digits is 580608, while the sum is 48.
The square root of 129673488 is about 11387.4267505877. The cubic root of 129673488 is about 506.1552326193.
The spelling of 129673488 in words is "one hundred twenty-nine million, six hundred seventy-three thousand, four hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •