Base | Representation |
---|---|
bin | 1111011001111… |
… | …10101011001100 |
3 | 100000011122101020 |
4 | 13230332223030 |
5 | 231040402224 |
6 | 20453514140 |
7 | 3126310260 |
oct | 754765314 |
9 | 300148336 |
10 | 129231564 |
11 | 66a47650 |
12 | 37342950 |
13 | 20a09aa7 |
14 | 132400a0 |
15 | b52ac79 |
hex | 7b3eacc |
129231564 has 48 divisors (see below), whose sum is σ = 375949056. Its totient is φ = 33566400.
The previous prime is 129231563. The next prime is 129231589. The reversal of 129231564 is 465132921.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (129231563) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 69007 + ... + 70854.
It is an arithmetic number, because the mean of its divisors is an integer number (7832272).
Almost surely, 2129231564 is an apocalyptic number.
129231564 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
129231564 is an abundant number, since it is smaller than the sum of its proper divisors (246717492).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
129231564 is a wasteful number, since it uses less digits than its factorization.
129231564 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139886 (or 139884 counting only the distinct ones).
The product of its digits is 12960, while the sum is 33.
The square root of 129231564 is about 11368.0061576338. The cubic root of 129231564 is about 505.5795900787.
It can be divided in two parts, 129231 and 564, that added together give a triangular number (129795 = T509).
The spelling of 129231564 in words is "one hundred twenty-nine million, two hundred thirty-one thousand, five hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •