Base | Representation |
---|---|
bin | 100000110011100010000… |
… | …111100101111010110101 |
3 | 21222111212222111001102102 |
4 | 200303202013211322311 |
5 | 243413410231113440 |
6 | 4443345335351445 |
7 | 321605025055256 |
oct | 40634207457265 |
9 | 7874788431372 |
10 | 2254356504245 |
11 | 79a08152616a |
12 | 304aab522585 |
13 | 13477b067511 |
14 | 7b17bad6b2d |
15 | 3d9934dcb15 |
hex | 20ce21e5eb5 |
2254356504245 has 8 divisors (see below), whose sum is σ = 2705235926400. Its totient is φ = 1803479789200.
The previous prime is 2254356504241. The next prime is 2254356504247. The reversal of 2254356504245 is 5424056534522.
2254356504245 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2254356504245 - 22 = 2254356504241 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2254356504245.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2254356504241) 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, 2580320 + ... + 3341670.
It is an arithmetic number, because the mean of its divisors is an integer number (338154490800).
Almost surely, 22254356504245 is an apocalyptic number.
It is an amenable number.
2254356504245 is a deficient number, since it is larger than the sum of its proper divisors (450879422155).
2254356504245 is an equidigital number, since it uses as much as digits as its factorization.
2254356504245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1353555.
The product of its (nonzero) digits is 5760000, while the sum is 47.
The spelling of 2254356504245 in words is "two trillion, two hundred fifty-four billion, three hundred fifty-six million, five hundred four thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •