Base | Representation |
---|---|
bin | 111100011001100000… |
… | …1101100101011010000 |
3 | 110101210101000212122212 |
4 | 1320303001230223100 |
5 | 4111114001231112 |
6 | 135330302251252 |
7 | 12241133114342 |
oct | 1706301545320 |
9 | 411711025585 |
10 | 129705102032 |
11 | 5000a16aa00 |
12 | 21179b86b28 |
13 | c300a720ac |
14 | 63c6263292 |
15 | 3592011522 |
hex | 1e3306cad0 |
129705102032 has 120 divisors (see below), whose sum is σ = 279193463808. Its totient is φ = 58326428160.
The previous prime is 129705101969. The next prime is 129705102103. The reversal of 129705102032 is 230201507921.
It is a self number, because there is not a number n which added to its sum of digits gives 129705102032.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 138425468 + ... + 138426404.
Almost surely, 2129705102032 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 129705102032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (139596731904).
129705102032 is an abundant number, since it is smaller than the sum of its proper divisors (149488361776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
129705102032 is a wasteful number, since it uses less digits than its factorization.
129705102032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1657 (or 1640 counting only the distinct ones).
The product of its (nonzero) digits is 7560, while the sum is 32.
Adding to 129705102032 its reverse (230201507921), we get a palindrome (359906609953).
The spelling of 129705102032 in words is "one hundred twenty-nine billion, seven hundred five million, one hundred two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •