Base | Representation |
---|---|
bin | 111101000000100101… |
… | …0000110001100011001 |
3 | 110112011201120122212012 |
4 | 1322001022012030121 |
5 | 4121310034122203 |
6 | 140104325555305 |
7 | 12315461000231 |
oct | 1720112061431 |
9 | 415151518765 |
10 | 131015926553 |
11 | 50622090856 |
12 | 21484b75b35 |
13 | c47c4c9cc5 |
14 | 64ac3a0cc1 |
15 | 361c13dbd8 |
hex | 1e81286319 |
131015926553 has 16 divisors (see below), whose sum is σ = 139582263744. Its totient is φ = 122547264000.
The previous prime is 131015926507. The next prime is 131015926619. The reversal of 131015926553 is 355629510131.
It is a cyclic number.
It is not a de Polignac number, because 131015926553 - 210 = 131015925529 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 131015926553.
It is not an unprimeable number, because it can be changed into a prime (131015923553) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1916426 + ... + 1983612.
It is an arithmetic number, because the mean of its divisors is an integer number (8723891484).
Almost surely, 2131015926553 is an apocalyptic number.
It is an amenable number.
131015926553 is a deficient number, since it is larger than the sum of its proper divisors (8566337191).
131015926553 is a wasteful number, since it uses less digits than its factorization.
131015926553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67912.
The product of its (nonzero) digits is 121500, while the sum is 41.
The spelling of 131015926553 in words is "one hundred thirty-one billion, fifteen million, nine hundred twenty-six thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •