Base | Representation |
---|---|
bin | 11101111000100100101011… |
… | …010100100000011101010011 |
3 | 122020100200102211112020010210 |
4 | 131320210223110200131103 |
5 | 114211331212340133021 |
6 | 1143310324424455203 |
7 | 36453402136532145 |
oct | 3570445324403523 |
9 | 566320384466123 |
10 | 131431021021011 |
11 | 38972645a6a768 |
12 | 128a826701a503 |
13 | 5844b79c4139a |
14 | 246541c672c95 |
15 | 102dc50cb6e76 |
hex | 77892b520753 |
131431021021011 has 32 divisors (see below), whose sum is σ = 179380381593600. Its totient is φ = 85574734277760.
The previous prime is 131431021020997. The next prime is 131431021021049. The reversal of 131431021021011 is 110120120134131.
It is a happy number.
It is not a de Polignac number, because 131431021021011 - 25 = 131431021020979 is a prime.
It is a super-2 number, since 2×1314310210210112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (131431021021051) 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, 102609505 + ... + 103882493.
It is an arithmetic number, because the mean of its divisors is an integer number (5605636924800).
Almost surely, 2131431021021011 is an apocalyptic number.
131431021021011 is a deficient number, since it is larger than the sum of its proper divisors (47949360572589).
131431021021011 is a wasteful number, since it uses less digits than its factorization.
131431021021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1277619.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 131431021021011 its reverse (110120120134131), we get a palindrome (241551141155142).
The spelling of 131431021021011 in words is "one hundred thirty-one trillion, four hundred thirty-one billion, twenty-one million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •