Base | Representation |
---|---|
bin | 111101000001111001… |
… | …1110011101000110101 |
3 | 110112021211021220120112 |
4 | 1322003303303220311 |
5 | 4121402431240104 |
6 | 140112555312405 |
7 | 12316541101235 |
oct | 1720363635065 |
9 | 415254256515 |
10 | 131060415029 |
11 | 50645207695 |
12 | 21497a4b705 |
13 | c4887a584b |
14 | 64b4261cc5 |
15 | 3620eca86e |
hex | 1e83cf3a35 |
131060415029 has 8 divisors (see below), whose sum is σ = 131393976480. Its totient is φ = 130727080656.
The previous prime is 131060415019. The next prime is 131060415041. The reversal of 131060415029 is 920514060131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131060415029 - 216 = 131060349493 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131060414986 and 131060415004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131060415019) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1130447 + ... + 1240979.
It is an arithmetic number, because the mean of its divisors is an integer number (16424247060).
Almost surely, 2131060415029 is an apocalyptic number.
It is an amenable number.
131060415029 is a deficient number, since it is larger than the sum of its proper divisors (333561451).
131060415029 is a wasteful number, since it uses less digits than its factorization.
131060415029 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113539.
The product of its (nonzero) digits is 6480, while the sum is 32.
The spelling of 131060415029 in words is "one hundred thirty-one billion, sixty million, four hundred fifteen thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •