Base | Representation |
---|---|
bin | 111101001101010000… |
… | …1001100000101111110 |
3 | 110120021101012111000022 |
4 | 1322122201030011332 |
5 | 4123143000113210 |
6 | 140214445332142 |
7 | 12332145361061 |
oct | 1723241140576 |
9 | 416241174008 |
10 | 131441410430 |
11 | 50820282120 |
12 | 21583567052 |
13 | c5196c1b05 |
14 | 650caba8d8 |
15 | 3644688155 |
hex | 1e9a84c17e |
131441410430 has 96 divisors (see below), whose sum is σ = 273216136320. Its totient is φ = 45146024640.
The previous prime is 131441410427. The next prime is 131441410453. The reversal of 131441410430 is 34014144131.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 131441410430.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 13774601 + ... + 13784139.
It is an arithmetic number, because the mean of its divisors is an integer number (2846001420).
Almost surely, 2131441410430 is an apocalyptic number.
131441410430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131441410430 is an abundant number, since it is smaller than the sum of its proper divisors (141774725890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131441410430 is a wasteful number, since it uses less digits than its factorization.
131441410430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9942 (or 9923 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 131441410430 its reverse (34014144131), we get a palindrome (165455554561).
The spelling of 131441410430 in words is "one hundred thirty-one billion, four hundred forty-one million, four hundred ten thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •