Base | Representation |
---|---|
bin | 111101000000011001… |
… | …1100010110011001111 |
3 | 110112011022110021221010 |
4 | 1322000303202303033 |
5 | 4121302030430130 |
6 | 140103555140303 |
7 | 12315356514540 |
oct | 1720063426317 |
9 | 415138407833 |
10 | 131010014415 |
11 | 50619812995 |
12 | 21482ba4693 |
13 | c47b209cb7 |
14 | 64ab6a24c7 |
15 | 361b8720b0 |
hex | 1e80ce2ccf |
131010014415 has 32 divisors (see below), whose sum is σ = 240378840576. Its totient is φ = 59685874560.
The previous prime is 131010014393. The next prime is 131010014479. The reversal of 131010014415 is 514410010131.
It is not a de Polignac number, because 131010014415 - 26 = 131010014351 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 131010014391 and 131010014400.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2098441 + ... + 2159970.
It is an arithmetic number, because the mean of its divisors is an integer number (7511838768).
Almost surely, 2131010014415 is an apocalyptic number.
131010014415 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
131010014415 is a deficient number, since it is larger than the sum of its proper divisors (109368826161).
131010014415 is a wasteful number, since it uses less digits than its factorization.
131010014415 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4258719.
The product of its (nonzero) digits is 240, while the sum is 21.
Adding to 131010014415 its reverse (514410010131), we get a palindrome (645420024546).
The spelling of 131010014415 in words is "one hundred thirty-one billion, ten million, fourteen thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •