Base | Representation |
---|---|
bin | 111101000011001011… |
… | …0010010111000010000 |
3 | 110112101210102222022220 |
4 | 1322012112102320100 |
5 | 4121444332312240 |
6 | 140121120301040 |
7 | 12320566125612 |
oct | 1720626227020 |
9 | 415353388286 |
10 | 131103010320 |
11 | 50667260107 |
12 | 214aa171780 |
13 | c49456a769 |
14 | 64b9b8cdb2 |
15 | 3624ae15d0 |
hex | 1e86592e10 |
131103010320 has 80 divisors (see below), whose sum is σ = 407254231680. Its totient is φ = 34888983552.
The previous prime is 131103010289. The next prime is 131103010373. The reversal of 131103010320 is 23010301131.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 131103010320.
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, 443965 + ... + 677724.
It is an arithmetic number, because the mean of its divisors is an integer number (5090677896).
Almost surely, 2131103010320 is an apocalyptic number.
131103010320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131103010320 is an abundant number, since it is smaller than the sum of its proper divisors (276151221360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131103010320 is a wasteful number, since it uses less digits than its factorization.
131103010320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1122192 (or 1122186 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 131103010320 its reverse (23010301131), we get a palindrome (154113311451).
The spelling of 131103010320 in words is "one hundred thirty-one billion, one hundred three million, ten thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •