Base | Representation |
---|---|
bin | 11101001010010110… |
… | …101011011011010101 |
3 | 2222211012111002122222 |
4 | 131022112223123111 |
5 | 1003111412330401 |
6 | 22215025432125 |
7 | 2155642364405 |
oct | 351226533325 |
9 | 88735432588 |
10 | 31312230101 |
11 | 12308a34a19 |
12 | 609a49b645 |
13 | 2c501c2a09 |
14 | 1730830805 |
15 | c33e32c1b |
hex | 74a5ab6d5 |
31312230101 has 4 divisors (see below), whose sum is σ = 31320060204. Its totient is φ = 31304400000.
The previous prime is 31312230091. The next prime is 31312230119. The reversal of 31312230101 is 10103221313.
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 7438890001 + 23873340100 = 86249^2 + 154510^2 .
It is a cyclic number.
It is not a de Polignac number, because 31312230101 - 214 = 31312213717 is a prime.
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 31312230101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31312230151) 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, 3909050 + ... + 3917051.
It is an arithmetic number, because the mean of its divisors is an integer number (7830015051).
Almost surely, 231312230101 is an apocalyptic number.
It is an amenable number.
31312230101 is a deficient number, since it is larger than the sum of its proper divisors (7830103).
31312230101 is an equidigital number, since it uses as much as digits as its factorization.
31312230101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7830102.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 31312230101 its reverse (10103221313), we get a palindrome (41415451414).
The spelling of 31312230101 in words is "thirty-one billion, three hundred twelve million, two hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •