Base | Representation |
---|---|
bin | 111100011000001101… |
… | …0010001111000000000 |
3 | 110101200022110010212220 |
4 | 1320300122101320000 |
5 | 4111021232323313 |
6 | 135322053451040 |
7 | 12240061064451 |
oct | 1706032217000 |
9 | 411608403786 |
10 | 129661214208 |
11 | 4aa97414379 |
12 | 21167340a80 |
13 | c2c4946a76 |
14 | 63c04bb128 |
15 | 358d242823 |
hex | 1e30691e00 |
129661214208 has 320 divisors, whose sum is σ = 392557017600. Its totient is φ = 37809192960.
The previous prime is 129661214183. The next prime is 129661214257. The reversal of 129661214208 is 802412166921.
It is a super-2 number, since 2×1296612142082 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 129661214208.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 19462398 + ... + 19469058.
It is an arithmetic number, because the mean of its divisors is an integer number (1226740680).
Almost surely, 2129661214208 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 129661214208, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (196278508800).
129661214208 is an abundant number, since it is smaller than the sum of its proper divisors (262895803392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
129661214208 is a wasteful number, since it uses less digits than its factorization.
129661214208 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6753 (or 6737 counting only the distinct ones).
The product of its (nonzero) digits is 82944, while the sum is 42.
The spelling of 129661214208 in words is "one hundred twenty-nine billion, six hundred sixty-one million, two hundred fourteen thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •