Base | Representation |
---|---|
bin | 111101001010111111… |
… | …1010001100011011011 |
3 | 110120002002012022102220 |
4 | 1322111333101203123 |
5 | 4123014021123120 |
6 | 140203132355123 |
7 | 12330233366355 |
oct | 1722577214333 |
9 | 416062168386 |
10 | 131365411035 |
11 | 50791393701 |
12 | 21562015aa3 |
13 | c506a32661 |
14 | 65029760d5 |
15 | 363cb74b40 |
hex | 1e95fd18db |
131365411035 has 16 divisors (see below), whose sum is σ = 210770138880. Its totient is φ = 69866392160.
The previous prime is 131365411031. The next prime is 131365411043. The reversal of 131365411035 is 530114563131.
It is a happy number.
It is not a de Polignac number, because 131365411035 - 22 = 131365411031 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131365410987 and 131365411005.
It is not an unprimeable number, because it can be changed into a prime (131365411031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12191961 + ... + 12202730.
It is an arithmetic number, because the mean of its divisors is an integer number (13173133680).
Almost surely, 2131365411035 is an apocalyptic number.
131365411035 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
131365411035 is a deficient number, since it is larger than the sum of its proper divisors (79404727845).
131365411035 is a wasteful number, since it uses less digits than its factorization.
131365411035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24395058.
The product of its (nonzero) digits is 16200, while the sum is 33.
Adding to 131365411035 its reverse (530114563131), we get a palindrome (661479974166).
The spelling of 131365411035 in words is "one hundred thirty-one billion, three hundred sixty-five million, four hundred eleven thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •