Base | Representation |
---|---|
bin | 111101000110011001… |
… | …1100000110110011111 |
3 | 110112200100021100010212 |
4 | 1322030303200312133 |
5 | 4122210100124043 |
6 | 140135550123035 |
7 | 12323352633341 |
oct | 1721463406637 |
9 | 415610240125 |
10 | 131211333023 |
11 | 50712416601 |
12 | 2151a4b047b |
13 | c4b0b36534 |
14 | 64ca309291 |
15 | 362e38c018 |
hex | 1e8cce0d9f |
131211333023 has 8 divisors (see below), whose sum is σ = 131380563600. Its totient is φ = 131042213568.
The previous prime is 131211332981. The next prime is 131211333047. The reversal of 131211333023 is 320333112131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131211333023 - 222 = 131207138719 is a prime.
It is a super-2 number, since 2×1312113330232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 131211333023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131211333073) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2478848 + ... + 2531226.
It is an arithmetic number, because the mean of its divisors is an integer number (16422570450).
Almost surely, 2131211333023 is an apocalyptic number.
131211333023 is a deficient number, since it is larger than the sum of its proper divisors (169230577).
131211333023 is a wasteful number, since it uses less digits than its factorization.
131211333023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55561.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 131211333023 its reverse (320333112131), we get a palindrome (451544445154).
The spelling of 131211333023 in words is "one hundred thirty-one billion, two hundred eleven million, three hundred thirty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •