Base | Representation |
---|---|
bin | 1110001001101111011001… |
… | …11011100100111100001110 |
3 | 11002012010202220121121211000 |
4 | 13010313230323210330032 |
5 | 13034341313323202202 |
6 | 150104443540241130 |
7 | 6361263500462646 |
oct | 704675473447416 |
9 | 132163686547730 |
10 | 31121013100302 |
11 | 9a09390632344 |
12 | 35a75643a01a6 |
13 | 1449911768088 |
14 | 79839d4d7526 |
15 | 38e7e041391c |
hex | 1c4decee4f0e |
31121013100302 has 64 divisors (see below), whose sum is σ = 69588833656320. Its totient is φ = 10309163155200.
The previous prime is 31121013100279. The next prime is 31121013100343. The reversal of 31121013100302 is 20300131012113.
31121013100302 is a `hidden beast` number, since 31 + 1 + 21 + 0 + 1 + 310 + 0 + 302 = 666.
It is a super-3 number, since 3×311210131003023 (a number of 41 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5638927 + ... + 9697397.
It is an arithmetic number, because the mean of its divisors is an integer number (1087325525880).
Almost surely, 231121013100302 is an apocalyptic number.
31121013100302 is an abundant number, since it is smaller than the sum of its proper divisors (38467820556018).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31121013100302 is a wasteful number, since it uses less digits than its factorization.
31121013100302 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4059366 (or 4059360 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 31121013100302 its reverse (20300131012113), we get a palindrome (51421144112415).
The spelling of 31121013100302 in words is "thirty-one trillion, one hundred twenty-one billion, thirteen million, one hundred thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •