Base | Representation |
---|---|
bin | 110111101110000001011100… |
… | …001010001011011001001011 |
3 | 1012010200001022020121112110221 |
4 | 313232001130022023121023 |
5 | 224104441022223300210 |
6 | 2225104445502250511 |
7 | 102421440210245005 |
oct | 6756013412133113 |
9 | 1163601266545427 |
10 | 245055200212555 |
11 | 7109a365a42657 |
12 | 2359940a886a37 |
13 | a6977b5b49165 |
14 | 4472a40ab3375 |
15 | 1d4e6ac6761da |
hex | dee05c28b64b |
245055200212555 has 8 divisors (see below), whose sum is σ = 306851728961952. Its totient is φ = 187520501032128.
The previous prime is 245055200212541. The next prime is 245055200212619. The reversal of 245055200212555 is 555212002550542.
245055200212555 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 a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-245055200212555 is a prime.
It is a super-2 number, since 2×2450552002125552 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1065457392114 + ... + 1065457392343.
It is an arithmetic number, because the mean of its divisors is an integer number (38356466120244).
Almost surely, 2245055200212555 is an apocalyptic number.
245055200212555 is a deficient number, since it is larger than the sum of its proper divisors (61796528749397).
245055200212555 is a wasteful number, since it uses less digits than its factorization.
245055200212555 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2130914784485.
The product of its (nonzero) digits is 1000000, while the sum is 43.
The spelling of 245055200212555 in words is "two hundred forty-five trillion, fifty-five billion, two hundred million, two hundred twelve thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •