Base | Representation |
---|---|
bin | 11101111000001001111100… |
… | …101010110001101010000100 |
3 | 122020020221100200110020101010 |
4 | 131320021330222301222010 |
5 | 114210343423141321202 |
6 | 1143245220512402220 |
7 | 36451335003662124 |
oct | 3570117452615204 |
9 | 566227320406333 |
10 | 131402321042052 |
11 | 38961458638795 |
12 | 128a2797546370 |
13 | 5842254cc0a08 |
14 | 2463c98b52c84 |
15 | 102d12138476c |
hex | 77827cab1a84 |
131402321042052 has 12 divisors (see below), whose sum is σ = 306605415764816. Its totient is φ = 43800773680680.
The previous prime is 131402321042021. The next prime is 131402321042129. The reversal of 131402321042052 is 250240123204131.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 5475096710074 + ... + 5475096710097.
Almost surely, 2131402321042052 is an apocalyptic number.
131402321042052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
131402321042052 is an abundant number, since it is smaller than the sum of its proper divisors (175203094722764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131402321042052 is a wasteful number, since it uses less digits than its factorization.
131402321042052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10950193420178 (or 10950193420176 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 30.
Adding to 131402321042052 its reverse (250240123204131), we get a palindrome (381642444246183).
The spelling of 131402321042052 in words is "one hundred thirty-one trillion, four hundred two billion, three hundred twenty-one million, forty-two thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.176 sec. • engine limits •