Base | Representation |
---|---|
bin | 1110001001101101100011… |
… | …11011011100111111101101 |
3 | 11002012001012220222002100210 |
4 | 13010312301323130333231 |
5 | 13034332301420241023 |
6 | 150104201415413033 |
7 | 6361230120535161 |
oct | 704666173347755 |
9 | 132161186862323 |
10 | 31120023212013 |
11 | 9a08a2289564a |
12 | 35a7328984179 |
13 | 14497b465b568 |
14 | 798307c5cca1 |
15 | 38e78357d593 |
hex | 1c4db1edcfed |
31120023212013 has 8 divisors (see below), whose sum is σ = 43677225560800. Its totient is φ = 19654751502288.
The previous prime is 31120023211997. The next prime is 31120023212059. The reversal of 31120023212013 is 31021232002113.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31120023212013 - 24 = 31120023211997 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31120023212093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 272982659698 + ... + 272982659811.
It is an arithmetic number, because the mean of its divisors is an integer number (5459653195100).
Almost surely, 231120023212013 is an apocalyptic number.
It is an amenable number.
31120023212013 is a deficient number, since it is larger than the sum of its proper divisors (12557202348787).
31120023212013 is a wasteful number, since it uses less digits than its factorization.
31120023212013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 545965319531.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 31120023212013 its reverse (31021232002113), we get a palindrome (62141255214126).
The spelling of 31120023212013 in words is "thirty-one trillion, one hundred twenty billion, twenty-three million, two hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •