Base | Representation |
---|---|
bin | 101101001001000100001… |
… | …110010110010111000001 |
3 | 101222120002110010112022001 |
4 | 231021010032112113001 |
5 | 401311110404000001 |
6 | 10333031244344001 |
7 | 440056126302406 |
oct | 55110416262701 |
9 | 11876073115261 |
10 | 3102111000001 |
11 | a96663873382 |
12 | 421262845001 |
13 | 1966b27ac270 |
14 | aa2004682ad |
15 | 55a5de6a001 |
hex | 2d2443965c1 |
3102111000001 has 4 divisors (see below), whose sum is σ = 3340734923092. Its totient is φ = 2863487076912.
The previous prime is 3102110999959. The next prime is 3102111000013. The reversal of 3102111000001 is 1000001112013.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 968177281600 + 2133933718401 = 983960^2 + 1460799^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3102111000001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3102111010001) 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, 119311961526 + ... + 119311961551.
It is an arithmetic number, because the mean of its divisors is an integer number (835183730773).
Almost surely, 23102111000001 is an apocalyptic number.
It is an amenable number.
3102111000001 is a deficient number, since it is larger than the sum of its proper divisors (238623923091).
3102111000001 is a wasteful number, since it uses less digits than its factorization.
3102111000001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 238623923090.
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 3102111000001 its reverse (1000001112013), we get a palindrome (4102112112014).
The spelling of 3102111000001 in words is "three trillion, one hundred two billion, one hundred eleven million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •