Base | Representation |
---|---|
bin | 11101110111001000000000… |
… | …110010111011111111100110 |
3 | 122020000011121200001211022112 |
4 | 131313020000302323333212 |
5 | 114203213424433030042 |
6 | 1143152511404001022 |
7 | 36443250402235331 |
oct | 3567100062737746 |
9 | 566004550054275 |
10 | 131331523330022 |
11 | 38934428128884 |
12 | 12890b19530172 |
13 | 5838681514a12 |
14 | 24606a0209618 |
15 | 102b37abee982 |
hex | 777200cbbfe6 |
131331523330022 has 8 divisors (see below), whose sum is σ = 201188716590816. Its totient is φ = 64268617799752.
The previous prime is 131331523329983. The next prime is 131331523330061. The reversal of 131331523330022 is 220033325133131.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (131331523329983) and next prime (131331523330061).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1313315233300222 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 698571932513 + ... + 698571932700.
It is an arithmetic number, because the mean of its divisors is an integer number (25148589573852).
Almost surely, 2131331523330022 is an apocalyptic number.
131331523330022 is a deficient number, since it is larger than the sum of its proper divisors (69857193260794).
131331523330022 is a wasteful number, since it uses less digits than its factorization.
131331523330022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1397143865262.
The product of its (nonzero) digits is 29160, while the sum is 32.
Adding to 131331523330022 its reverse (220033325133131), we get a palindrome (351364848463153).
The spelling of 131331523330022 in words is "one hundred thirty-one trillion, three hundred thirty-one billion, five hundred twenty-three million, three hundred thirty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •