Base | Representation |
---|---|
bin | 11100111110000011… |
… | …111111001000000101 |
3 | 2222021211102200220021 |
4 | 130332003333020011 |
5 | 1002201114102321 |
6 | 22142341335141 |
7 | 2150556444511 |
oct | 347603771005 |
9 | 88254380807 |
10 | 31106003461 |
11 | 12212589885 |
12 | 60414074b1 |
13 | 2c19568510 |
14 | 17112ab141 |
15 | c20c98941 |
hex | 73e0ff205 |
31106003461 has 8 divisors (see below), whose sum is σ = 34653903480. Its totient is φ = 27723122112.
The previous prime is 31106003443. The next prime is 31106003507. The reversal of 31106003461 is 16430060113.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 9466122436 + 21639881025 = 97294^2 + 147105^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31106003461 - 25 = 31106003429 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 (31106003261) 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 7 ways as a sum of consecutive naturals, for example, 41254270 + ... + 41255023.
It is an arithmetic number, because the mean of its divisors is an integer number (4331737935).
Almost surely, 231106003461 is an apocalyptic number.
It is an amenable number.
31106003461 is a deficient number, since it is larger than the sum of its proper divisors (3547900019).
31106003461 is a wasteful number, since it uses less digits than its factorization.
31106003461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82509335.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 31106003461 its reverse (16430060113), we get a palindrome (47536063574).
The spelling of 31106003461 in words is "thirty-one billion, one hundred six million, three thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •