Base | Representation |
---|---|
bin | 1110000111001011101100… |
… | …01110000110100110001001 |
3 | 11001212201220122020022201220 |
4 | 13003211312032012212021 |
5 | 13031421313230401441 |
6 | 150000230335432253 |
7 | 6352032460500030 |
oct | 703456616064611 |
9 | 131781818208656 |
10 | 31033122122121 |
11 | 9985089451599 |
12 | 3592515985689 |
13 | 1441545872202 |
14 | 794022753717 |
15 | 38c3992d2466 |
hex | 1c3976386989 |
31033122122121 has 8 divisors (see below), whose sum is σ = 47288567043264. Its totient is φ = 17733212641200.
The previous prime is 31033122122111. The next prime is 31033122122137. The reversal of 31033122122121 is 12122122133013.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31033122122121 - 215 = 31033122089353 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31033122122091 and 31033122122100.
It is not an unprimeable number, because it can be changed into a prime (31033122122111) 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, 738883860030 + ... + 738883860071.
It is an arithmetic number, because the mean of its divisors is an integer number (5911070880408).
Almost surely, 231033122122121 is an apocalyptic number.
It is an amenable number.
31033122122121 is a deficient number, since it is larger than the sum of its proper divisors (16255444921143).
31033122122121 is a wasteful number, since it uses less digits than its factorization.
31033122122121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1477767720111.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 31033122122121 its reverse (12122122133013), we get a palindrome (43155244255134).
The spelling of 31033122122121 in words is "thirty-one trillion, thirty-three billion, one hundred twenty-two million, one hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •