Base | Representation |
---|---|
bin | 111101000001010011… |
… | …0011110000000001000 |
3 | 110112020102010220021102 |
4 | 1322002212132000020 |
5 | 4121332234010240 |
6 | 140110553000532 |
7 | 12316203552224 |
oct | 1720246360010 |
9 | 415212126242 |
10 | 131040141320 |
11 | 5063481a760 |
12 | 214910b3148 |
13 | c48452797a |
14 | 64b16a5784 |
15 | 361e323815 |
hex | 1e8299e008 |
131040141320 has 64 divisors (see below), whose sum is σ = 323024682240. Its totient is φ = 47446412800.
The previous prime is 131040141313. The next prime is 131040141329. The reversal of 131040141320 is 23141040131.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 131040141292 and 131040141301.
It is not an unprimeable number, because it can be changed into a prime (131040141329) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 536576 + ... + 741615.
It is an arithmetic number, because the mean of its divisors is an integer number (5047260660).
Almost surely, 2131040141320 is an apocalyptic number.
131040141320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131040141320 is an abundant number, since it is smaller than the sum of its proper divisors (191984540920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131040141320 is a wasteful number, since it uses less digits than its factorization.
131040141320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1278446 (or 1278442 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 131040141320 its reverse (23141040131), we get a palindrome (154181181451).
The spelling of 131040141320 in words is "one hundred thirty-one billion, forty million, one hundred forty-one thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •