Base | Representation |
---|---|
bin | 111100001000111011… |
… | …0011111011011001001 |
3 | 110100100120201101012220 |
4 | 1320101312133123021 |
5 | 4103444010003131 |
6 | 135155140524253 |
7 | 12221264162556 |
oct | 1702166373311 |
9 | 410316641186 |
10 | 129148516041 |
11 | 4a853a74686 |
12 | 210436b0689 |
13 | c242666c7c |
14 | 637237ba2d |
15 | 355d21be96 |
hex | 1e11d9f6c9 |
129148516041 has 16 divisors (see below), whose sum is σ = 176232062400. Its totient is φ = 84100580928.
The previous prime is 129148515989. The next prime is 129148516067. The reversal of 129148516041 is 140615841921.
It is not a de Polignac number, because 129148516041 - 210 = 129148515017 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 129148515984 and 129148516002.
It is not an unprimeable number, because it can be changed into a prime (129148916041) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2295946 + ... + 2351523.
It is an arithmetic number, because the mean of its divisors is an integer number (11014503900).
Almost surely, 2129148516041 is an apocalyptic number.
It is an amenable number.
129148516041 is a deficient number, since it is larger than the sum of its proper divisors (47083546359).
129148516041 is a wasteful number, since it uses less digits than its factorization.
129148516041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4647688.
The product of its (nonzero) digits is 69120, while the sum is 42.
The spelling of 129148516041 in words is "one hundred twenty-nine billion, one hundred forty-eight million, five hundred sixteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •