Base | Representation |
---|---|
bin | 100000100110101111010… |
… | …111111110111010110101 |
3 | 21221012102200022121011021 |
4 | 200212233113332322311 |
5 | 243202242241323140 |
6 | 4433154324141141 |
7 | 320610441656065 |
oct | 40465727767265 |
9 | 7835380277137 |
10 | 2240620261045 |
11 | 7942727a7361 |
12 | 3022b72377b1 |
13 | 13339c2a686a |
14 | 7a63767b3a5 |
15 | 3d43c609b4a |
hex | 209af5feeb5 |
2240620261045 has 4 divisors (see below), whose sum is σ = 2688744313260. Its totient is φ = 1792496208832.
The previous prime is 2240620261043. The next prime is 2240620261049. The reversal of 2240620261045 is 5401620260422.
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 416151429604 + 1824468831441 = 645098^2 + 1350729^2 .
It is a cyclic number.
It is not a de Polignac number, because 2240620261045 - 21 = 2240620261043 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2240620261045.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2240620261043) 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, 224062026100 + ... + 224062026109.
It is an arithmetic number, because the mean of its divisors is an integer number (672186078315).
Almost surely, 22240620261045 is an apocalyptic number.
It is an amenable number.
2240620261045 is a deficient number, since it is larger than the sum of its proper divisors (448124052215).
2240620261045 is an equidigital number, since it uses as much as digits as its factorization.
2240620261045 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 448124052214.
The product of its (nonzero) digits is 46080, while the sum is 34.
The spelling of 2240620261045 in words is "two trillion, two hundred forty billion, six hundred twenty million, two hundred sixty-one thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •