Base | Representation |
---|---|
bin | 11101110110101101100011… |
… | …001111100001110011100110 |
3 | 122012220110021111210100011110 |
4 | 131312231203033201303212 |
5 | 114202232232204033110 |
6 | 1143131452140245450 |
7 | 36441223321631016 |
oct | 3566554317416346 |
9 | 565813244710143 |
10 | 131303110221030 |
11 | 38923377722520 |
12 | 12887509b40886 |
13 | 5835aa3b459a7 |
14 | 245d166841c46 |
15 | 102a766585a20 |
hex | 776b633e1ce6 |
131303110221030 has 64 divisors (see below), whose sum is σ = 343859698713600. Its totient is φ = 31823253054720.
The previous prime is 131303110221007. The next prime is 131303110221061. The reversal of 131303110221030 is 30122011303131.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 131303110220988 and 131303110221006.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 47426695 + ... + 50118834.
It is an arithmetic number, because the mean of its divisors is an integer number (5372807792400).
Almost surely, 2131303110221030 is an apocalyptic number.
131303110221030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131303110221030 is an abundant number, since it is smaller than the sum of its proper divisors (212556588492570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131303110221030 is a wasteful number, since it uses less digits than its factorization.
131303110221030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 97549629.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 131303110221030 its reverse (30122011303131), we get a palindrome (161425121524161).
The spelling of 131303110221030 in words is "one hundred thirty-one trillion, three hundred three billion, one hundred ten million, two hundred twenty-one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •