Base | Representation |
---|---|
bin | 11101100110100110011… |
… | …001011100101110000101 |
3 | 21012110220122110102111202 |
4 | 131212212121130232011 |
5 | 231312232133020401 |
6 | 4154314421312245 |
7 | 266655062030516 |
oct | 35464631345605 |
9 | 7173818412452 |
10 | 2034311220101 |
11 | 714823716336 |
12 | 28a31a865685 |
13 | 119ab0b76984 |
14 | 70665702a0d |
15 | 37db535506b |
hex | 1d9a665cb85 |
2034311220101 has 8 divisors (see below), whose sum is σ = 2053259412600. Its totient is φ = 2015368205760.
The previous prime is 2034311220083. The next prime is 2034311220107. The reversal of 2034311220101 is 1010221134302.
It can be written as a sum of positive squares in 4 ways, for example, as 986195969476 + 1048115250625 = 993074^2 + 1023775^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 2034311220101 - 210 = 2034311219077 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2034311220107) 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, 502910 + ... + 2078831.
It is an arithmetic number, because the mean of its divisors is an integer number (256657426575).
Almost surely, 22034311220101 is an apocalyptic number.
It is an amenable number.
2034311220101 is a deficient number, since it is larger than the sum of its proper divisors (18948192499).
2034311220101 is a wasteful number, since it uses less digits than its factorization.
2034311220101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2589079.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 2034311220101 its reverse (1010221134302), we get a palindrome (3044532354403).
The spelling of 2034311220101 in words is "two trillion, thirty-four billion, three hundred eleven million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •