Base | Representation |
---|---|
bin | 100011010111101100100011… |
… | …1011101111100110001111001 |
3 | 1111210120210012112002011022102 |
4 | 1012233121013131330301321 |
5 | 311234342320221133423 |
6 | 3021410323454033145 |
7 | 122350452424212431 |
oct | 10657310735746171 |
9 | 1453523175064272 |
10 | 311120040021113 |
11 | 901502a4788a54 |
12 | 2aa89193aa87b5 |
13 | 1047a6560b655b |
14 | 56b840c7712c1 |
15 | 25e7e2d776c28 |
hex | 11af64777cc79 |
311120040021113 has 8 divisors (see below), whose sum is σ = 316493164373760. Its totient is φ = 305750245779760.
The previous prime is 311120040021053. The next prime is 311120040021127.
311120040021113 is nontrivially palindromic in base 10.
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 311120040021113 - 220 = 311120038972537 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (311120040021913) 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, 832339358 + ... + 832713063.
It is an arithmetic number, because the mean of its divisors is an integer number (39561645546720).
Almost surely, 2311120040021113 is an apocalyptic number.
It is an amenable number.
311120040021113 is a deficient number, since it is larger than the sum of its proper divisors (5373124352647).
311120040021113 is a wasteful number, since it uses less digits than its factorization.
311120040021113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1665055647.
The product of its (nonzero) digits is 144, while the sum is 20.
The spelling of 311120040021113 in words is "three hundred eleven trillion, one hundred twenty billion, forty million, twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •