Base | Representation |
---|---|
bin | 11110001100111000001… |
… | …101100001010110000001 |
3 | 21100102000001100012222012 |
4 | 132030320031201112001 |
5 | 233000421020210023 |
6 | 4225233051422305 |
7 | 302641436146616 |
oct | 36147015412601 |
9 | 7312001305865 |
10 | 2075412272513 |
11 | 7301a5138348 |
12 | 29628b454995 |
13 | 120931087c28 |
14 | 7264420450d |
15 | 38ebd82e978 |
hex | 1e338361581 |
2075412272513 has 4 divisors (see below), whose sum is σ = 2098731511620. Its totient is φ = 2052093033408.
The previous prime is 2075412272509. The next prime is 2075412272533. The reversal of 2075412272513 is 3152722145702.
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 115700661904 + 1959711610609 = 340148^2 + 1399897^2 .
It is a cyclic number.
It is not a de Polignac number, because 2075412272513 - 22 = 2075412272509 is a prime.
It is a super-2 number, since 2×20754122725132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2075412272503) 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, 11659619420 + ... + 11659619597.
It is an arithmetic number, because the mean of its divisors is an integer number (524682877905).
Almost surely, 22075412272513 is an apocalyptic number.
It is an amenable number.
2075412272513 is a deficient number, since it is larger than the sum of its proper divisors (23319239107).
2075412272513 is an equidigital number, since it uses as much as digits as its factorization.
2075412272513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23319239106.
The product of its (nonzero) digits is 235200, while the sum is 41.
The spelling of 2075412272513 in words is "two trillion, seventy-five billion, four hundred twelve million, two hundred seventy-two thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •