Base | Representation |
---|---|
bin | 11101110110101101100010… |
… | …101101001010000111111100 |
3 | 122012220110020212211120220112 |
4 | 131312231202231022013330 |
5 | 114202232222402224012 |
6 | 1143131451215205152 |
7 | 36441223152224054 |
oct | 3566554255120774 |
9 | 565813225746815 |
10 | 131303101211132 |
11 | 38923372629224 |
12 | 12887506b167b8 |
13 | 5835aa200c9a6 |
14 | 245d165578564 |
15 | 102a7658a6122 |
hex | 776b62b4a1fc |
131303101211132 has 48 divisors (see below), whose sum is σ = 242036161382400. Its totient is φ = 62154547542720.
The previous prime is 131303101211101. The next prime is 131303101211137. The reversal of 131303101211132 is 231112101303131.
It is a junction number, because it is equal to n+sod(n) for n = 131303101211098 and 131303101211107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131303101211137) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2016323669 + ... + 2016388787.
It is an arithmetic number, because the mean of its divisors is an integer number (5042420028800).
Almost surely, 2131303101211132 is an apocalyptic number.
It is an amenable number.
131303101211132 is a deficient number, since it is larger than the sum of its proper divisors (110733060171268).
131303101211132 is a wasteful number, since it uses less digits than its factorization.
131303101211132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82506 (or 82504 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 23.
Adding to 131303101211132 its reverse (231112101303131), we get a palindrome (362415202514263).
The spelling of 131303101211132 in words is "one hundred thirty-one trillion, three hundred three billion, one hundred one million, two hundred eleven thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •