Base | Representation |
---|---|
bin | 1110001001100001000011… |
… | …11010101001001010010101 |
3 | 11002011101220012211221122020 |
4 | 13010300201322221022111 |
5 | 13034230030400111201 |
6 | 150101131441323353 |
7 | 6360601610251545 |
oct | 704604172511225 |
9 | 132141805757566 |
10 | 31113312113301 |
11 | 9a06099624880 |
12 | 35a5b75336559 |
13 | 1448c85168732 |
14 | 797c6c827325 |
15 | 38e4de2cea36 |
hex | 1c4c21ea9295 |
31113312113301 has 8 divisors (see below), whose sum is σ = 45255726710304. Its totient is φ = 18856552795920.
The previous prime is 31113312113251. The next prime is 31113312113339. The reversal of 31113312113301 is 10331121331113.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31113312113301 - 222 = 31113307918997 is a prime.
It is a super-2 number, since 2×311133121133012 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31113312113341) 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, 471413819866 + ... + 471413819931.
It is an arithmetic number, because the mean of its divisors is an integer number (5656965838788).
Almost surely, 231113312113301 is an apocalyptic number.
It is an amenable number.
31113312113301 is a deficient number, since it is larger than the sum of its proper divisors (14142414597003).
31113312113301 is a wasteful number, since it uses less digits than its factorization.
31113312113301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 942827639811.
The product of its (nonzero) digits is 486, while the sum is 24.
Adding to 31113312113301 its reverse (10331121331113), we get a palindrome (41444433444414).
The spelling of 31113312113301 in words is "thirty-one trillion, one hundred thirteen billion, three hundred twelve million, one hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •