Base | Representation |
---|---|
bin | 111101001100100111… |
… | …1100010001011111001 |
3 | 110120012212220222102210 |
4 | 1322121033202023321 |
5 | 4123122010130423 |
6 | 140212402445333 |
7 | 12331465416645 |
oct | 1723117421371 |
9 | 416185828383 |
10 | 131420005113 |
11 | 5080a191a81 |
12 | 21578363849 |
13 | c515138b47 |
14 | 6509d07c25 |
15 | 364285ab93 |
hex | 1e993e22f9 |
131420005113 has 8 divisors (see below), whose sum is σ = 175606776576. Its totient is φ = 87423285200.
The previous prime is 131420005081. The next prime is 131420005133. The reversal of 131420005113 is 311500024131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131420005113 - 25 = 131420005081 is a prime.
It is a super-2 number, since 2×1314200051132 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 131420005113.
It is not an unprimeable number, because it can be changed into a prime (131420005133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47511273 + ... + 47514038.
It is an arithmetic number, because the mean of its divisors is an integer number (21950847072).
Almost surely, 2131420005113 is an apocalyptic number.
It is an amenable number.
131420005113 is a deficient number, since it is larger than the sum of its proper divisors (44186771463).
131420005113 is an equidigital number, since it uses as much as digits as its factorization.
131420005113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95025775.
The product of its (nonzero) digits is 360, while the sum is 21.
Adding to 131420005113 its reverse (311500024131), we get a palindrome (442920029244).
The spelling of 131420005113 in words is "one hundred thirty-one billion, four hundred twenty million, five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •