Base | Representation |
---|---|
bin | 11101110011111010101111… |
… | …101111010101111010011100 |
3 | 122012020002201101111201100220 |
4 | 131303322233233111322130 |
5 | 114141111033221213040 |
6 | 1142503341141521340 |
7 | 36421315531553553 |
oct | 3563725757257234 |
9 | 565202641451326 |
10 | 131111120101020 |
11 | 38859a06267754 |
12 | 12856268a13250 |
13 | 5820958118997 |
14 | 2453b5247ad9a |
15 | 102577b40e2d0 |
hex | 773eafbd5e9c |
131111120101020 has 24 divisors (see below), whose sum is σ = 367111136283024. Its totient is φ = 34962965360256.
The previous prime is 131111120100931. The next prime is 131111120101037. The reversal of 131111120101020 is 20101021111131.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1092592667449 + ... + 1092592667568.
It is an arithmetic number, because the mean of its divisors is an integer number (15296297345126).
Almost surely, 2131111120101020 is an apocalyptic number.
131111120101020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131111120101020 is an abundant number, since it is smaller than the sum of its proper divisors (236000016182004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131111120101020 is a wasteful number, since it uses less digits than its factorization.
131111120101020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2185185335029 (or 2185185335027 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 15.
Adding to 131111120101020 its reverse (20101021111131), we get a palindrome (151212141212151).
The spelling of 131111120101020 in words is "one hundred thirty-one trillion, one hundred eleven billion, one hundred twenty million, one hundred one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •