Base | Representation |
---|---|
bin | 101101010110001111010… |
… | …100110000000001011011 |
3 | 102000220121020012102121121 |
4 | 231112033110300001123 |
5 | 402024043000333232 |
6 | 10343331014150111 |
7 | 441066503566513 |
oct | 55261724600133 |
9 | 12026536172547 |
10 | 3116255871067 |
11 | aa1662220369 |
12 | 423b4b952337 |
13 | 197b28112661 |
14 | aab82c92843 |
15 | 560dab67d97 |
hex | 2d58f53005b |
3116255871067 has 4 divisors (see below), whose sum is σ = 3188726937880. Its totient is φ = 3043784804256.
The previous prime is 3116255871023. The next prime is 3116255871101. The reversal of 3116255871067 is 7601785526113.
3116255871067 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3116255871067 is a prime.
It is a super-2 number, since 2×31162558710672 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3116255878067) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 36235533342 + ... + 36235533427.
It is an arithmetic number, because the mean of its divisors is an integer number (797181734470).
Almost surely, 23116255871067 is an apocalyptic number.
3116255871067 is a deficient number, since it is larger than the sum of its proper divisors (72471066813).
3116255871067 is an equidigital number, since it uses as much as digits as its factorization.
3116255871067 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72471066812.
The product of its (nonzero) digits is 2116800, while the sum is 52.
The spelling of 3116255871067 in words is "three trillion, one hundred sixteen billion, two hundred fifty-five million, eight hundred seventy-one thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •