Base | Representation |
---|---|
bin | 11101111000001001111100… |
… | …101011000010100001001000 |
3 | 122020020221100200120202002220 |
4 | 131320021330223002201020 |
5 | 114210343423201023422 |
6 | 1143245220514054040 |
7 | 36451335004400352 |
oct | 3570117453024110 |
9 | 566227320522086 |
10 | 131402321111112 |
11 | 38961458685667 |
12 | 128a279757a320 |
13 | 584225501628c |
14 | 2463c98b700d2 |
15 | 102d121399e5c |
hex | 77827cac2848 |
131402321111112 has 64 divisors (see below), whose sum is σ = 329374399757760. Its totient is φ = 43684993536000.
The previous prime is 131402321111081. The next prime is 131402321111123. The reversal of 131402321111112 is 211111123204131.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 63373888 + ... + 65414480.
It is an arithmetic number, because the mean of its divisors is an integer number (5146474996215).
Almost surely, 2131402321111112 is an apocalyptic number.
131402321111112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
131402321111112 is an abundant number, since it is smaller than the sum of its proper divisors (197972078646648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131402321111112 is a wasteful number, since it uses less digits than its factorization.
131402321111112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2047694 (or 2047690 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 24.
Adding to 131402321111112 its reverse (211111123204131), we get a palindrome (342513444315243).
The spelling of 131402321111112 in words is "one hundred thirty-one trillion, four hundred two billion, three hundred twenty-one million, one hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •