Base | Representation |
---|---|
bin | 11101000110000111… |
… | …101110011011001001 |
3 | 2222122020211110112121 |
4 | 131012013232123021 |
5 | 1002440221420403 |
6 | 22204011211241 |
7 | 2154120554455 |
oct | 350607563311 |
9 | 88566743477 |
10 | 31241201353 |
11 | 12281930a7a |
12 | 607a746b21 |
13 | 2c3b583b7b |
14 | 1725221665 |
15 | c2caa23bd |
hex | 7461ee6c9 |
31241201353 has 4 divisors (see below), whose sum is σ = 31245595668. Its totient is φ = 31236807040.
The previous prime is 31241201351. The next prime is 31241201363. The reversal of 31241201353 is 35310214213.
It is a happy number.
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 5033476809 + 26207724544 = 70947^2 + 161888^2 .
It is a cyclic number.
It is not a de Polignac number, because 31241201353 - 21 = 31241201351 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31241201351) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 2186476 + ... + 2200717.
It is an arithmetic number, because the mean of its divisors is an integer number (7811398917).
Almost surely, 231241201353 is an apocalyptic number.
It is an amenable number.
31241201353 is a deficient number, since it is larger than the sum of its proper divisors (4394315).
31241201353 is an equidigital number, since it uses as much as digits as its factorization.
31241201353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4394314.
The product of its (nonzero) digits is 2160, while the sum is 25.
Adding to 31241201353 its reverse (35310214213), we get a palindrome (66551415566).
The spelling of 31241201353 in words is "thirty-one billion, two hundred forty-one million, two hundred one thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •