Base | Representation |
---|---|
bin | 111101000100000000… |
… | …1111010000000110110 |
3 | 110112110202112011202200 |
4 | 1322020001322000312 |
5 | 4122024043020042 |
6 | 140124005045330 |
7 | 12321360656625 |
oct | 1721001720066 |
9 | 415422464680 |
10 | 131131220022 |
11 | 50681178510 |
12 | 214b76b6846 |
13 | c49a3668aa |
14 | 64bd8136bc |
15 | 3627314c4c |
hex | 1e8807a036 |
131131220022 has 48 divisors (see below), whose sum is σ = 310682932560. Its totient is φ = 39642321600.
The previous prime is 131131219981. The next prime is 131131220093. The reversal of 131131220022 is 220022131131.
131131220022 is a `hidden beast` number, since 1 + 311 + 312 + 20 + 0 + 22 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 131131219977 and 131131220004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 703197 + ... + 869912.
It is an arithmetic number, because the mean of its divisors is an integer number (6472561095).
Almost surely, 2131131220022 is an apocalyptic number.
131131220022 is an abundant number, since it is smaller than the sum of its proper divisors (179551712538).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131131220022 is a wasteful number, since it uses less digits than its factorization.
131131220022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1573549 (or 1573546 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 131131220022 its reverse (220022131131), we get a palindrome (351153351153).
It can be divided in two parts, 131131 and 220022, that added together give a palindrome (351153).
The spelling of 131131220022 in words is "one hundred thirty-one billion, one hundred thirty-one million, two hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •