Base | Representation |
---|---|
bin | 11101110101010111111101… |
… | …100100000011100101011111 |
3 | 122012120200001211100001200210 |
4 | 131311113331210003211133 |
5 | 114144231024230404043 |
6 | 1143021333040023503 |
7 | 36431461050020310 |
oct | 3565277544034537 |
9 | 565520054301623 |
10 | 131211210013023 |
11 | 388983a8423a98 |
12 | 12871740901b93 |
13 | 582a21944929a |
14 | 2458929424607 |
15 | 10281884a9633 |
hex | 7755fd90395f |
131211210013023 has 32 divisors (see below), whose sum is σ = 200107826012160. Its totient is φ = 74915259528960.
The previous prime is 131211210012989. The next prime is 131211210013031. The reversal of 131211210013023 is 320310012112131.
It is not a de Polignac number, because 131211210013023 - 26 = 131211210012959 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131211210013033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 122574273 + ... + 123640101.
It is an arithmetic number, because the mean of its divisors is an integer number (6253369562880).
Almost surely, 2131211210013023 is an apocalyptic number.
131211210013023 is a deficient number, since it is larger than the sum of its proper divisors (68896615999137).
131211210013023 is a wasteful number, since it uses less digits than its factorization.
131211210013023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1070727.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 131211210013023 its reverse (320310012112131), we get a palindrome (451521222125154).
The spelling of 131211210013023 in words is "one hundred thirty-one trillion, two hundred eleven billion, two hundred ten million, thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.205 sec. • engine limits •