Base | Representation |
---|---|
bin | 11101110111000000000110… |
… | …001001100110010100000100 |
3 | 122012222100200021121121012122 |
4 | 131313000012021212110010 |
5 | 114203044022421101040 |
6 | 1143144544121105112 |
7 | 36442526636431340 |
oct | 3567000611462404 |
9 | 565870607547178 |
10 | 131323023222020 |
11 | 3893086602a933 |
12 | 1288b346928198 |
13 | 58379284ac606 |
14 | 24600d535c620 |
15 | 102b02e8691b5 |
hex | 777006266504 |
131323023222020 has 48 divisors (see below), whose sum is σ = 315231974400000. Its totient is φ = 45016933866624.
The previous prime is 131323023221981. The next prime is 131323023222037. The reversal of 131323023222020 is 20222320323131.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 83622020 + ... + 85177979.
It is an arithmetic number, because the mean of its divisors is an integer number (6567332800000).
Almost surely, 2131323023222020 is an apocalyptic number.
131323023222020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131323023222020 is an abundant number, since it is smaller than the sum of its proper divisors (183908951177980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131323023222020 is a wasteful number, since it uses less digits than its factorization.
131323023222020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168805572 (or 168805570 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 131323023222020 its reverse (20222320323131), we get a palindrome (151545343545151).
The spelling of 131323023222020 in words is "one hundred thirty-one trillion, three hundred twenty-three billion, twenty-three million, two hundred twenty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •