Base | Representation |
---|---|
bin | 1100110100100000010… |
… | …0000100110101000001 |
3 | 210001111202200011120212 |
4 | 3031020010010311001 |
5 | 12102034101010001 |
6 | 245103232243505 |
7 | 21625026112232 |
oct | 3151004046501 |
9 | 701452604525 |
10 | 220252360001 |
11 | 85454796003 |
12 | 3682a0a0595 |
13 | 17a0108474b |
14 | a935ad9089 |
15 | 5ae143d7bb |
hex | 3348104d41 |
220252360001 has 4 divisors (see below), whose sum is σ = 225374507952. Its totient is φ = 215130212052.
The previous prime is 220252359991. The next prime is 220252360007. The reversal of 220252360001 is 100063252022.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 220252360001 - 26 = 220252359937 is a prime.
It is a super-2 number, since 2×2202523600012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (220252360007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2561073911 + ... + 2561073996.
It is an arithmetic number, because the mean of its divisors is an integer number (56343626988).
Almost surely, 2220252360001 is an apocalyptic number.
It is an amenable number.
220252360001 is a deficient number, since it is larger than the sum of its proper divisors (5122147951).
220252360001 is an equidigital number, since it uses as much as digits as its factorization.
220252360001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5122147950.
The product of its (nonzero) digits is 1440, while the sum is 23.
The spelling of 220252360001 in words is "two hundred twenty billion, two hundred fifty-two million, three hundred sixty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •