Base | Representation |
---|---|
bin | 111101000001100111… |
… | …0001011100010001001 |
3 | 110112021010201210021011 |
4 | 1322003032023202021 |
5 | 4121342420121213 |
6 | 140112004043521 |
7 | 12316361210344 |
oct | 1720316134211 |
9 | 415233653234 |
10 | 131050551433 |
11 | 5063a68aa5a |
12 | 214946935a1 |
13 | c4867310b9 |
14 | 64b2c1545b |
15 | 36201cd03d |
hex | 1e8338b889 |
131050551433 has 32 divisors (see below), whose sum is σ = 142227993600. Its totient is φ = 120509337600.
The previous prime is 131050551427. The next prime is 131050551469. The reversal of 131050551433 is 334155050131.
It is a cyclic number.
It is not a de Polignac number, because 131050551433 - 221 = 131048454281 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131050551395 and 131050551404.
It is not an unprimeable number, because it can be changed into a prime (131050551733) 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 31 ways as a sum of consecutive naturals, for example, 8165785 + ... + 8181817.
It is an arithmetic number, because the mean of its divisors is an integer number (4444624800).
Almost surely, 2131050551433 is an apocalyptic number.
It is an amenable number.
131050551433 is a deficient number, since it is larger than the sum of its proper divisors (11177442167).
131050551433 is a wasteful number, since it uses less digits than its factorization.
131050551433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16273.
The product of its (nonzero) digits is 13500, while the sum is 31.
The spelling of 131050551433 in words is "one hundred thirty-one billion, fifty million, five hundred fifty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •