Base | Representation |
---|---|
bin | 11101110010011000000111… |
… | …010000111010000001001011 |
3 | 122011211222100122010101020021 |
4 | 131302120013100322001023 |
5 | 114132342134332210201 |
6 | 1142342544205441311 |
7 | 36410546223445510 |
oct | 3562300720720113 |
9 | 564758318111207 |
10 | 131005214335051 |
11 | 38818aaa214231 |
12 | 12839831270237 |
13 | 581397ac15684 |
14 | 244c986d3b307 |
15 | 1022b2d9a2ea1 |
hex | 77260743a04b |
131005214335051 has 8 divisors (see below), whose sum is σ = 150253057216224. Its totient is φ = 111890574519360.
The previous prime is 131005214335019. The next prime is 131005214335139. The reversal of 131005214335051 is 150533412500131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 131005214335051 - 25 = 131005214335019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131005214334998 and 131005214335016.
It is not an unprimeable number, because it can be changed into a prime (131005214332051) 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, 33300764260 + ... + 33300768193.
It is an arithmetic number, because the mean of its divisors is an integer number (18781632152028).
Almost surely, 2131005214335051 is an apocalyptic number.
131005214335051 is a deficient number, since it is larger than the sum of its proper divisors (19247842881173).
131005214335051 is an equidigital number, since it uses as much as digits as its factorization.
131005214335051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66601532741.
The product of its (nonzero) digits is 27000, while the sum is 34.
Adding to 131005214335051 its reverse (150533412500131), we get a palindrome (281538626835182).
The spelling of 131005214335051 in words is "one hundred thirty-one trillion, five billion, two hundred fourteen million, three hundred thirty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •