Base | Representation |
---|---|
bin | 11101110110110101000001… |
… | …011100000000101000111110 |
3 | 122012221012222122001212002120 |
4 | 131312311001130000220332 |
5 | 114202400200022033202 |
6 | 1143135300212303410 |
7 | 36441626200302621 |
oct | 3566650134005076 |
9 | 565835878055076 |
10 | 131311133002302 |
11 | 3892681433a870 |
12 | 12888b88911b66 |
13 | 5836782004146 |
14 | 245d6c8159db8 |
15 | 102aa85a810bc |
hex | 776d41700a3e |
131311133002302 has 64 divisors (see below), whose sum is σ = 292602158383104. Its totient is φ = 38943370931040.
The previous prime is 131311133002279. The next prime is 131311133002303. The reversal of 131311133002302 is 203200331113131.
It is a super-2 number, since 2×1313111330023022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131311133002303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 97550163 + ... + 98887089.
It is an arithmetic number, because the mean of its divisors is an integer number (4571908724736).
Almost surely, 2131311133002302 is an apocalyptic number.
131311133002302 is an abundant number, since it is smaller than the sum of its proper divisors (161291025380802).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131311133002302 is a wasteful number, since it uses less digits than its factorization.
131311133002302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1368653.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 131311133002302 its reverse (203200331113131), we get a palindrome (334511464115433).
The spelling of 131311133002302 in words is "one hundred thirty-one trillion, three hundred eleven billion, one hundred thirty-three million, two thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •