Base | Representation |
---|---|
bin | 11101110100000101001010… |
… | …110010110001111100010100 |
3 | 122012021011121022220212210012 |
4 | 131310011022302301330110 |
5 | 114141301443204432312 |
6 | 1142512431442215352 |
7 | 36422163053226122 |
oct | 3564051262617424 |
9 | 565234538825705 |
10 | 131122311405332 |
11 | 38863729489285 |
12 | 12858470954558 |
13 | 5821a1c874640 |
14 | 24544d4908912 |
15 | 1025bd3b8b322 |
hex | 77414acb1f14 |
131122311405332 has 48 divisors (see below), whose sum is σ = 251276319150864. Its totient is φ = 59499792000000.
The previous prime is 131122311405317. The next prime is 131122311405353. The reversal of 131122311405332 is 233504113221131.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 69771372761476 + 61350938643856 = 8352926^2 + 7832684^2 .
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1825919 + ... + 16296582.
It is an arithmetic number, because the mean of its divisors is an integer number (5234923315643).
Almost surely, 2131122311405332 is an apocalyptic number.
It is an amenable number.
131122311405332 is a deficient number, since it is larger than the sum of its proper divisors (120154007745532).
131122311405332 is a wasteful number, since it uses less digits than its factorization.
131122311405332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18124860 (or 18124858 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 32.
Adding to 131122311405332 its reverse (233504113221131), we get a palindrome (364626424626463).
The spelling of 131122311405332 in words is "one hundred thirty-one trillion, one hundred twenty-two billion, three hundred eleven million, four hundred five thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •