Base | Representation |
---|---|
bin | 11101000100011111… |
… | …011111011101110011 |
3 | 2222120100102020201111 |
4 | 131010133133131303 |
5 | 1002411223031412 |
6 | 22201153414151 |
7 | 2153336402110 |
oct | 350437373563 |
9 | 88510366644 |
10 | 31213877107 |
11 | 12268468956 |
12 | 607156a357 |
13 | 2c35a07a8a |
14 | 172174b907 |
15 | c2a4a62a7 |
hex | 7447df773 |
31213877107 has 8 divisors (see below), whose sum is σ = 35678280800. Its totient is φ = 26750793024.
The previous prime is 31213877099. The next prime is 31213877159. The reversal of 31213877107 is 70177831213.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 31213877107 - 23 = 31213877099 is a prime.
It is a super-2 number, since 2×312138771072 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 31213877107.
It is not an unprimeable number, because it can be changed into a prime (31213877707) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 278682 + ... + 374287.
It is an arithmetic number, because the mean of its divisors is an integer number (4459785100).
Almost surely, 231213877107 is an apocalyptic number.
31213877107 is a deficient number, since it is larger than the sum of its proper divisors (4464403693).
31213877107 is an equidigital number, since it uses as much as digits as its factorization.
31213877107 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 659805.
The product of its (nonzero) digits is 49392, while the sum is 40.
The spelling of 31213877107 in words is "thirty-one billion, two hundred thirteen million, eight hundred seventy-seven thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •