Base | Representation |
---|---|
bin | 111100000101101011… |
… | …1011111100011111001 |
3 | 110100002000000022111021 |
4 | 1320023113133203321 |
5 | 4103233132224331 |
6 | 135140253102441 |
7 | 12215503403104 |
oct | 1701327374371 |
9 | 410060008437 |
10 | 129039726841 |
11 | 4a7a861a753 |
12 | 21013187a21 |
13 | c225c66a6c |
14 | 6361b3d73b |
15 | 35538cd211 |
hex | 1e0b5df8f9 |
129039726841 has 9 divisors (see below), whose sum is σ = 131860920901. Its totient is φ = 126277676572.
The previous prime is 129039726821. The next prime is 129039726847. The reversal of 129039726841 is 148627930921.
The square root of 129039726841 is 359221.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 129039726841 - 27 = 129039726713 is a prime.
It is a super-2 number, since 2×1290397268412 (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 (129039726847) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 16879566 + ... + 16887208.
Almost surely, 2129039726841 is an apocalyptic number.
129039726841 is the 359221-st square number.
129039726841 is the 179611-st centered octagonal number.
It is an amenable number.
129039726841 is a deficient number, since it is larger than the sum of its proper divisors (2821194060).
129039726841 is an frugal number, since it uses more digits than its factorization.
129039726841 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15380 (or 7690 counting only the distinct ones).
The product of its (nonzero) digits is 1306368, while the sum is 52.
The spelling of 129039726841 in words is "one hundred twenty-nine billion, thirty-nine million, seven hundred twenty-six thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •