Base | Representation |
---|---|
bin | 111100001101010001… |
… | …0110110001111001111 |
3 | 110100201202011002122110 |
4 | 1320122202312033033 |
5 | 4104243324032201 |
6 | 135221430515103 |
7 | 12225014640255 |
oct | 1703242661717 |
9 | 410652132573 |
10 | 129294361551 |
11 | 4a919329563 |
12 | 21084505a93 |
13 | c26693cba4 |
14 | 63878a45d5 |
15 | 356ae2a6d6 |
hex | 1e1a8b63cf |
129294361551 has 8 divisors (see below), whose sum is σ = 173355569280. Its totient is φ = 85714697432.
The previous prime is 129294361519. The next prime is 129294361649. The reversal of 129294361551 is 155163492921.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 129294361551 - 25 = 129294361519 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 129294361551.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (129294361351) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 120385275 + ... + 120386348.
It is an arithmetic number, because the mean of its divisors is an integer number (21669446160).
Almost surely, 2129294361551 is an apocalyptic number.
129294361551 is a deficient number, since it is larger than the sum of its proper divisors (44061207729).
129294361551 is a wasteful number, since it uses less digits than its factorization.
129294361551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 240771805.
The product of its digits is 583200, while the sum is 48.
The spelling of 129294361551 in words is "one hundred twenty-nine billion, two hundred ninety-four million, three hundred sixty-one thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •