Base | Representation |
---|---|
bin | 111100011101011101… |
… | …1100011011001100100 |
3 | 110102010121120000002100 |
4 | 1320322323203121210 |
5 | 4111401423141100 |
6 | 135351400412100 |
7 | 12244333213314 |
oct | 1707273433144 |
9 | 412117500070 |
10 | 129837708900 |
11 | 50078002459 |
12 | 211b6477030 |
13 | c3223912b3 |
14 | 63d9b01444 |
15 | 359d9a7400 |
hex | 1e3aee3664 |
129837708900 has 81 divisors (see below), whose sum is σ = 407002971193. Its totient is φ = 34620506400.
The previous prime is 129837708893. The next prime is 129837708967. The reversal of 129837708900 is 9807738921.
The square root of 129837708900 is 360330.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 46741575204 + 83096133696 = 216198^2 + 288264^2 .
It is a super-2 number, since 2×1298377089002 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 10803895 + ... + 10815905.
Almost surely, 2129837708900 is an apocalyptic number.
129837708900 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
129837708900 is the 360330-th square number.
It is an amenable number.
129837708900 is an abundant number, since it is smaller than the sum of its proper divisors (277165262293).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
129837708900 is an equidigital number, since it uses as much as digits as its factorization.
129837708900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24042 (or 12021 counting only the distinct ones).
The product of its (nonzero) digits is 1524096, while the sum is 54.
The spelling of 129837708900 in words is "one hundred twenty-nine billion, eight hundred thirty-seven million, seven hundred eight thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •