Base | Representation |
---|---|
bin | 11101111000001011110011… |
… | …011010000010101100100100 |
3 | 122020021010111111221111122110 |
4 | 131320023303122002230210 |
5 | 114210412013131102400 |
6 | 1143250150314201020 |
7 | 36451435243400613 |
oct | 3570136332025444 |
9 | 566233444844573 |
10 | 131404313144100 |
11 | 38962290080517 |
12 | 128a3052723170 |
13 | 58424b1931219 |
14 | 246400755387a |
15 | 102d1db1d6e50 |
hex | 7782f3682b24 |
131404313144100 has 72 divisors (see below), whose sum is σ = 392460881951488. Its totient is φ = 33910790486400.
The previous prime is 131404313144063. The next prime is 131404313144147. The reversal of 131404313144100 is 1441313404131.
It is a Harshad number since it is a multiple of its sum of digits (30).
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 23 ways as a sum of consecutive naturals, for example, 7064738719 + ... + 7064757318.
Almost surely, 2131404313144100 is an apocalyptic number.
131404313144100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131404313144100 is an abundant number, since it is smaller than the sum of its proper divisors (261056568807388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131404313144100 is a wasteful number, since it uses less digits than its factorization.
131404313144100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14129496085 (or 14129496078 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 30.
Adding to 131404313144100 its reverse (1441313404131), we get a palindrome (132845626548231).
The spelling of 131404313144100 in words is "one hundred thirty-one trillion, four hundred four billion, three hundred thirteen million, one hundred forty-four thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •