Base | Representation |
---|---|
bin | 1111011001010… |
… | …00111010011111 |
3 | 100000000010010000 |
4 | 13230220322133 |
5 | 231030024211 |
6 | 20451545343 |
7 | 3125456355 |
oct | 754507237 |
9 | 300003100 |
10 | 129142431 |
11 | 66996690 |
12 | 372bb253 |
13 | 209a8352 |
14 | 132197d5 |
15 | b50e656 |
hex | 7b28e9f |
129142431 has 20 divisors (see below), whose sum is σ = 210455784. Its totient is φ = 78267600.
The previous prime is 129142399. The next prime is 129142441. The reversal of 129142431 is 134241921.
It is a happy number.
It is not a de Polignac number, because 129142431 - 25 = 129142399 is a prime.
It is a super-2 number, since 2×1291424312 = 33355534969179522, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 129142395 and 129142404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (129142441) 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 19 ways as a sum of consecutive naturals, for example, 71580 + ... + 73361.
Almost surely, 2129142431 is an apocalyptic number.
129142431 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
129142431 is a deficient number, since it is larger than the sum of its proper divisors (81313353).
129142431 is a wasteful number, since it uses less digits than its factorization.
129142431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144964 (or 144955 counting only the distinct ones).
The product of its digits is 1728, while the sum is 27.
The square root of 129142431 is about 11364.0851369567. The cubic root of 129142431 is about 505.4633280021.
The spelling of 129142431 in words is "one hundred twenty-nine million, one hundred forty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •