Base | Representation |
---|---|
bin | 111101000011001101… |
… | …0001010011101010001 |
3 | 110112101212100111101110 |
4 | 1322012122022131101 |
5 | 4122000112240101 |
6 | 140121154123533 |
7 | 12320610551250 |
oct | 1720632123521 |
9 | 415355314343 |
10 | 131104024401 |
11 | 50667892a99 |
12 | 214aa5805a9 |
13 | c4948341cc |
14 | 64b9d74797 |
15 | 3624c41cd6 |
hex | 1e8668a751 |
131104024401 has 8 divisors (see below), whose sum is σ = 199777561024. Its totient is φ = 74916585360.
The previous prime is 131104024399. The next prime is 131104024417. The reversal of 131104024401 is 104420401131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 131104024401 - 21 = 131104024399 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 6243048781 = 131104024401 / (1 + 3 + 1 + 1 + 0 + 4 + 0 + 2 + 4 + 4 + 0 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131104024421) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3121524370 + ... + 3121524411.
It is an arithmetic number, because the mean of its divisors is an integer number (24972195128).
Almost surely, 2131104024401 is an apocalyptic number.
It is an amenable number.
131104024401 is a deficient number, since it is larger than the sum of its proper divisors (68673536623).
131104024401 is an equidigital number, since it uses as much as digits as its factorization.
131104024401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6243048791.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 131104024401 its reverse (104420401131), we get a palindrome (235524425532).
The spelling of 131104024401 in words is "one hundred thirty-one billion, one hundred four million, twenty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •