Base | Representation |
---|---|
bin | 1110001001011011000100… |
… | …11101011010011000001001 |
3 | 11002011002121100200210201121 |
4 | 13010231202131122120021 |
5 | 13034201441100033223 |
6 | 150055441014515241 |
7 | 6360426164620513 |
oct | 704554235323011 |
9 | 132132540623647 |
10 | 31110100002313 |
11 | 9a047a045a2a2 |
12 | 35a5419665b21 |
13 | 1448892849547 |
14 | 797a45da8bb3 |
15 | 38e3a22dd15d |
hex | 1c4b6275a609 |
31110100002313 has 8 divisors (see below), whose sum is σ = 32965041643560. Its totient is φ = 29257929000960.
The previous prime is 31110100002229. The next prime is 31110100002383. The reversal of 31110100002313 is 31320000101113.
It can be written as a sum of positive squares in 4 ways, for example, as 11179473719184 + 19930626283129 = 3343572^2 + 4464373^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 31110100002313 - 233 = 31101510067721 is a prime.
It is not an unprimeable number, because it can be changed into a prime (31110100002383) 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, 692636848 + ... + 692681761.
It is an arithmetic number, because the mean of its divisors is an integer number (4120630205445).
Almost surely, 231110100002313 is an apocalyptic number.
It is an amenable number.
31110100002313 is a deficient number, since it is larger than the sum of its proper divisors (1854941641247).
31110100002313 is a wasteful number, since it uses less digits than its factorization.
31110100002313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1385319947.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 31110100002313 its reverse (31320000101113), we get a palindrome (62430100103426).
The spelling of 31110100002313 in words is "thirty-one trillion, one hundred ten billion, one hundred million, two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •