Base | Representation |
---|---|
bin | 111101001101000000… |
… | …1011111101011001101 |
3 | 110120020210120101000202 |
4 | 1322122001133223031 |
5 | 4123133333231104 |
6 | 140213551303245 |
7 | 12332014635245 |
oct | 1723201375315 |
9 | 416223511022 |
10 | 131433102029 |
11 | 50816617979 |
12 | 2158081ab25 |
13 | c517a731b8 |
14 | 650b956b25 |
15 | 3643a9651e |
hex | 1e9a05facd |
131433102029 has 2 divisors, whose sum is σ = 131433102030. Its totient is φ = 131433102028.
The previous prime is 131433102023. The next prime is 131433102049. The reversal of 131433102029 is 920201334131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 98704673929 + 32728428100 = 314173^2 + 180910^2 .
It is a cyclic number.
It is not a de Polignac number, because 131433102029 - 212 = 131433097933 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131433101992 and 131433102010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131433102023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65716551014 + 65716551015.
It is an arithmetic number, because the mean of its divisors is an integer number (65716551015).
Almost surely, 2131433102029 is an apocalyptic number.
It is an amenable number.
131433102029 is a deficient number, since it is larger than the sum of its proper divisors (1).
131433102029 is an equidigital number, since it uses as much as digits as its factorization.
131433102029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 29.
The spelling of 131433102029 in words is "one hundred thirty-one billion, four hundred thirty-three million, one hundred two thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •