Base | Representation |
---|---|
bin | 100111110000100001011… |
… | …100111000110101100001 |
3 | 100200012011221211220211202 |
4 | 213300201130320311201 |
5 | 324230431031434332 |
6 | 5451045343450545 |
7 | 401251324254413 |
oct | 47604134706541 |
9 | 10605157756752 |
10 | 2732160421217 |
11 | 96378036a997 |
12 | 381616bb6a55 |
13 | 16a84584ab46 |
14 | 963470d69b3 |
15 | 4b10a6ada62 |
hex | 27c21738d61 |
2732160421217 has 4 divisors (see below), whose sum is σ = 2747255230356. Its totient is φ = 2717065612080.
The previous prime is 2732160421169. The next prime is 2732160421223. The reversal of 2732160421217 is 7121240612372.
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 69124823056 + 2663035598161 = 262916^2 + 1631881^2 .
It is a cyclic number.
It is not a de Polignac number, because 2732160421217 - 216 = 2732160355681 is a prime.
It is a super-2 number, since 2×27321604212172 (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 (2732160421717) 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, 7547404298 + ... + 7547404659.
It is an arithmetic number, because the mean of its divisors is an integer number (686813807589).
Almost surely, 22732160421217 is an apocalyptic number.
It is an amenable number.
2732160421217 is a deficient number, since it is larger than the sum of its proper divisors (15094809139).
2732160421217 is a wasteful number, since it uses less digits than its factorization.
2732160421217 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15094809138.
The product of its (nonzero) digits is 56448, while the sum is 38.
The spelling of 2732160421217 in words is "two trillion, seven hundred thirty-two billion, one hundred sixty million, four hundred twenty-one thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •