Base | Representation |
---|---|
bin | 111100010011001001… |
… | …0000111100110010001 |
3 | 110101020110201202020211 |
4 | 1320212102013212101 |
5 | 4110144233142201 |
6 | 135253144004121 |
7 | 12232625625100 |
oct | 1704622074621 |
9 | 411213652224 |
10 | 129491302801 |
11 | 4aa0a512423 |
12 | 2111a460641 |
13 | c298695b83 |
14 | 63a5acc037 |
15 | 357d37d651 |
hex | 1e26487991 |
129491302801 has 9 divisors (see below), whose sum is σ = 150635670249. Its totient is φ = 110990386164.
The previous prime is 129491302763. The next prime is 129491302861. The reversal of 129491302801 is 108203194921.
It is a happy number.
The square root of 129491302801 is 359849.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 129491302801 - 227 = 129357085073 is a prime.
It is a super-2 number, since 2×1294913028012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (129491302861) 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 8 ways as a sum of consecutive naturals, for example, 2493240 + ... + 2544646.
Almost surely, 2129491302801 is an apocalyptic number.
129491302801 is the 359849-th square number.
129491302801 is the 179925-th centered octagonal number.
It is an amenable number.
129491302801 is a deficient number, since it is larger than the sum of its proper divisors (21144367448).
129491302801 is an frugal number, since it uses more digits than its factorization.
129491302801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102828 (or 51414 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 40.
The spelling of 129491302801 in words is "one hundred twenty-nine billion, four hundred ninety-one million, three hundred two thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •