Base | Representation |
---|---|
bin | 11101100001011000000101… |
… | …000011111101010000000001 |
3 | 122000201021212000200011110201 |
4 | 131201120011003331100001 |
5 | 114004222031222001343 |
6 | 1140050134130525201 |
7 | 36230260365030004 |
oct | 3541300503752001 |
9 | 560637760604421 |
10 | 129836946281473 |
11 | 384085a3374152 |
12 | 1268b32a736801 |
13 | 575a757776232 |
14 | 240c1dac9b53b |
15 | 10025549a594d |
hex | 7616050fd401 |
129836946281473 has 16 divisors (see below), whose sum is σ = 136175801864256. Its totient is φ = 123652562664960.
The previous prime is 129836946281437. The next prime is 129836946281501. The reversal of 129836946281473 is 374182649638921.
It is a de Polignac number, because none of the positive numbers 2k-129836946281473 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 129836946281396 and 129836946281405.
It is not an unprimeable number, because it can be changed into a prime (129836946282473) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18333640 + ... + 24408937.
It is an arithmetic number, because the mean of its divisors is an integer number (8510987616516).
Almost surely, 2129836946281473 is an apocalyptic number.
It is an amenable number.
129836946281473 is a deficient number, since it is larger than the sum of its proper divisors (6338855582783).
129836946281473 is a wasteful number, since it uses less digits than its factorization.
129836946281473 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42744384.
The product of its digits is 752467968, while the sum is 73.
The spelling of 129836946281473 in words is "one hundred twenty-nine trillion, eight hundred thirty-six billion, nine hundred forty-six million, two hundred eighty-one thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •