Base | Representation |
---|---|
bin | 1110010010100101110111… |
… | …10101101100001001101101 |
3 | 11010021012202111021010102101 |
4 | 13021102323311230021231 |
5 | 13104332132312321110 |
6 | 150500301215055101 |
7 | 6422251032661546 |
oct | 711227365541155 |
9 | 133235674233371 |
10 | 31425132151405 |
11 | a016361936703 |
12 | 3636499211491 |
13 | 146c4b9a6c415 |
14 | 7a8dad6dd4cd |
15 | 39768e51213a |
hex | 1c94bbd6c26d |
31425132151405 has 4 divisors (see below), whose sum is σ = 37710158581692. Its totient is φ = 25140105721120.
The previous prime is 31425132151403. The next prime is 31425132151417. The reversal of 31425132151405 is 50415123152413.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5066375241321 + 26358756910084 = 2250861^2 + 5134078^2 .
It is not a de Polignac number, because 31425132151405 - 21 = 31425132151403 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31425132151403) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3142513215136 + ... + 3142513215145.
It is an arithmetic number, because the mean of its divisors is an integer number (9427539645423).
Almost surely, 231425132151405 is an apocalyptic number.
It is an amenable number.
31425132151405 is a deficient number, since it is larger than the sum of its proper divisors (6285026430287).
31425132151405 is an equidigital number, since it uses as much as digits as its factorization.
31425132151405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6285026430286.
The product of its (nonzero) digits is 72000, while the sum is 37.
The spelling of 31425132151405 in words is "thirty-one trillion, four hundred twenty-five billion, one hundred thirty-two million, one hundred fifty-one thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •