Base | Representation |
---|---|
bin | 111100000110100001… |
… | …0100101011011010001 |
3 | 110100010221211121000000 |
4 | 1320031002211123101 |
5 | 4103312324102043 |
6 | 135143134520213 |
7 | 12216264125616 |
oct | 1701502453321 |
9 | 410127747000 |
10 | 129067800273 |
11 | 4a812454735 |
12 | 21020666069 |
13 | c22ba15b69 |
14 | 636576a50d |
15 | 35560c62d3 |
hex | 1e0d0a56d1 |
129067800273 has 14 divisors (see below), whose sum is σ = 193513177634. Its totient is φ = 86045199696.
The previous prime is 129067800269. The next prime is 129067800283. The reversal of 129067800273 is 372008760921.
It can be written as a sum of positive squares in only one way, i.e., 79137003969 + 49930796304 = 281313^2 + 223452^2 .
It is not a de Polignac number, because 129067800273 - 22 = 129067800269 is a prime.
It is a super-2 number, since 2×1290678002732 (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 (129067800283) 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 13 ways as a sum of consecutive naturals, for example, 88523140 + ... + 88524597.
It is an arithmetic number, because the mean of its divisors is an integer number (13822369831).
Almost surely, 2129067800273 is an apocalyptic number.
It is an amenable number.
129067800273 is a deficient number, since it is larger than the sum of its proper divisors (64445377361).
129067800273 is an frugal number, since it uses more digits than its factorization.
129067800273 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177047755 (or 177047740 counting only the distinct ones).
The product of its (nonzero) digits is 254016, while the sum is 45.
The spelling of 129067800273 in words is "one hundred twenty-nine billion, sixty-seven million, eight hundred thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •