Base | Representation |
---|---|
bin | 11101001011011110… |
… | …010010111011000101 |
3 | 2222212111210220202022 |
4 | 131023132102323011 |
5 | 1003131214112401 |
6 | 22220540052525 |
7 | 2156261066165 |
oct | 351336227305 |
9 | 88774726668 |
10 | 31331004101 |
11 | 12318598121 |
12 | 60a4834145 |
13 | 2c540670a7 |
14 | 173311a5a5 |
15 | c358e071b |
hex | 74b792ec5 |
31331004101 has 8 divisors (see below), whose sum is σ = 31950389184. Its totient is φ = 30716759520.
The previous prime is 31331004083. The next prime is 31331004119. The reversal of 31331004101 is 10140013313.
It is an interprime number because it is at equal distance from previous prime (31331004083) and next prime (31331004119).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31331004101 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 31331004101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31331004191) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1272815 + ... + 1297196.
It is an arithmetic number, because the mean of its divisors is an integer number (3993798648).
Almost surely, 231331004101 is an apocalyptic number.
It is an amenable number.
31331004101 is a deficient number, since it is larger than the sum of its proper divisors (619385083).
31331004101 is a wasteful number, since it uses less digits than its factorization.
31331004101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2570251.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 31331004101 its reverse (10140013313), we get a palindrome (41471017414).
The spelling of 31331004101 in words is "thirty-one billion, three hundred thirty-one million, four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.176 sec. • engine limits •