Base | Representation |
---|---|
bin | 11101110111010100111101… |
… | …001011100000010110001111 |
3 | 122020001111111020120010012002 |
4 | 131313110331023200112033 |
5 | 114203430410323231411 |
6 | 1143203130433502515 |
7 | 36444251661126440 |
oct | 3567247513402617 |
9 | 566044436503162 |
10 | 131345421305231 |
11 | 3893a30a182301 |
12 | 12893757a11a3b |
13 | 5839a879515a3 |
14 | 246121bd252c7 |
15 | 102b8e0dcd33b |
hex | 77753d2e058f |
131345421305231 has 32 divisors (see below), whose sum is σ = 155718292105728. Its totient is φ = 108447351344640.
The previous prime is 131345421305227. The next prime is 131345421305239. The reversal of 131345421305231 is 132503124543131.
It is a happy number.
It is not a de Polignac number, because 131345421305231 - 22 = 131345421305227 is a prime.
It is a super-2 number, since 2×1313454213052312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131345421305239) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 245324816 + ... + 245859626.
It is an arithmetic number, because the mean of its divisors is an integer number (4866196628304).
Almost surely, 2131345421305231 is an apocalyptic number.
131345421305231 is a deficient number, since it is larger than the sum of its proper divisors (24372870800497).
131345421305231 is a wasteful number, since it uses less digits than its factorization.
131345421305231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 546111.
The product of its (nonzero) digits is 129600, while the sum is 38.
Adding to 131345421305231 its reverse (132503124543131), we get a palindrome (263848545848362).
The spelling of 131345421305231 in words is "one hundred thirty-one trillion, three hundred forty-five billion, four hundred twenty-one million, three hundred five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •