Base | Representation |
---|---|
bin | 11101110111000110110010… |
… | …100001011110111001010101 |
3 | 122020000001020011001102122202 |
4 | 131313012302201132321111 |
5 | 114203203232243202131 |
6 | 1143152133213334245 |
7 | 36443203015234331 |
oct | 3567066241367125 |
9 | 566001204042582 |
10 | 131330210131541 |
11 | 38933913936383 |
12 | 12890811797385 |
13 | 58385024383b5 |
14 | 24605b7a507c1 |
15 | 102b3007a3bcb |
hex | 7771b285ee55 |
131330210131541 has 8 divisors (see below), whose sum is σ = 134263284885120. Its totient is φ = 128425750741728.
The previous prime is 131330210131499. The next prime is 131330210131577. The reversal of 131330210131541 is 145131012033131.
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 131330210131541 - 222 = 131330205937237 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131330210131441) 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, 7153831661 + ... + 7153850018.
It is an arithmetic number, because the mean of its divisors is an integer number (16782910610640).
Almost surely, 2131330210131541 is an apocalyptic number.
It is an amenable number.
131330210131541 is a deficient number, since it is larger than the sum of its proper divisors (2933074753579).
131330210131541 is a wasteful number, since it uses less digits than its factorization.
131330210131541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14307681883.
The product of its (nonzero) digits is 3240, while the sum is 29.
Adding to 131330210131541 its reverse (145131012033131), we get a palindrome (276461222164672).
The spelling of 131330210131541 in words is "one hundred thirty-one trillion, three hundred thirty billion, two hundred ten million, one hundred thirty-one thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •