Base | Representation |
---|---|
bin | 1110001111011000110010… |
… | …11010111101000010110001 |
3 | 11002212200120111101100021112 |
4 | 13013230121122331002301 |
5 | 13101031141430120223 |
6 | 150333532205203105 |
7 | 6411302466034544 |
oct | 707543132750261 |
9 | 132780514340245 |
10 | 31315033051313 |
11 | 9a836a385a1a0 |
12 | 3619091260495 |
13 | 1461cc1b8550b |
14 | 7a39272c085b |
15 | 394898891778 |
hex | 1c7b196bd0b1 |
31315033051313 has 8 divisors (see below), whose sum is σ = 34165867244256. Its totient is φ = 28464867692800.
The previous prime is 31315033051277. The next prime is 31315033051333.
31315033051313 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31315033051313 - 224 = 31315016274097 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 31315033051313.
It is not an unprimeable number, because it can be changed into a prime (31315033051333) 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, 167110703 + ... + 167297988.
It is an arithmetic number, because the mean of its divisors is an integer number (4270733405532).
Almost surely, 231315033051313 is an apocalyptic number.
It is an amenable number.
31315033051313 is a deficient number, since it is larger than the sum of its proper divisors (2850834192943).
31315033051313 is a wasteful number, since it uses less digits than its factorization.
31315033051313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 334417215.
The product of its (nonzero) digits is 18225, while the sum is 32.
It can be divided in two parts, 3131503 and 3051313, that added together give a palindrome (6182816).
The spelling of 31315033051313 in words is "thirty-one trillion, three hundred fifteen billion, thirty-three million, fifty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •