Base | Representation |
---|---|
bin | 1111011011000… |
… | …10000000000000 |
3 | 100000102222212012 |
4 | 13231202000000 |
5 | 231110020011 |
6 | 20500552052 |
7 | 3130452152 |
oct | 755420000 |
9 | 300388765 |
10 | 129376256 |
11 | 67036329 |
12 | 373b2628 |
13 | 20a5a8c9 |
14 | 1327aad2 |
15 | b558a8b |
hex | 7b62000 |
129376256 has 56 divisors (see below), whose sum is σ = 274251420. Its totient is φ = 60817408.
The previous prime is 129376231. The next prime is 129376267. The reversal of 129376256 is 652673921.
It can be written as a sum of positive squares in 2 ways, for example, as 125440000 + 3936256 = 11200^2 + 1984^2 .
Its product of digits (136080) is a multiple of the sum of its prime factors (972).
It is a nialpdrome in base 8.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 138800 + ... + 139728.
Almost surely, 2129376256 is an apocalyptic number.
129376256 is a gapful number since it is divisible by the number (16) 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 129376256, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (137125710).
129376256 is an abundant number, since it is smaller than the sum of its proper divisors (144875164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
129376256 is an frugal number, since it uses more digits than its factorization.
129376256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 972 (or 948 counting only the distinct ones).
The product of its digits is 136080, while the sum is 41.
The square root of 129376256 is about 11374.3683780683. The cubic root of 129376256 is about 505.7682076659.
The spelling of 129376256 in words is "one hundred twenty-nine million, three hundred seventy-six thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •