Base | Representation |
---|---|
bin | 100100011000100101011… |
… | …111110010001100001001 |
3 | 22212000201012122221201001 |
4 | 210120211133302030021 |
5 | 311431103303232210 |
6 | 5152342203255001 |
7 | 345432523544263 |
oct | 44304537621411 |
9 | 8760635587631 |
10 | 2500300055305 |
11 | 88440a220278 |
12 | 3446a951a461 |
13 | 151a148cc160 |
14 | 8902d89cb33 |
15 | 4508a13103a |
hex | 246257f2309 |
2500300055305 has 8 divisors (see below), whose sum is σ = 3231156994632. Its totient is φ = 1846375425408.
The previous prime is 2500300055293. The next prime is 2500300055369. The reversal of 2500300055305 is 5035500030052.
It can be written as a sum of positive squares in 4 ways, for example, as 215132702976 + 2285167352329 = 463824^2 + 1511677^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2500300055305 - 229 = 2499763184393 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19233077284 + ... + 19233077413.
It is an arithmetic number, because the mean of its divisors is an integer number (403894624329).
Almost surely, 22500300055305 is an apocalyptic number.
It is an amenable number.
2500300055305 is a deficient number, since it is larger than the sum of its proper divisors (730856939327).
2500300055305 is a wasteful number, since it uses less digits than its factorization.
2500300055305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38466154715.
The product of its (nonzero) digits is 11250, while the sum is 28.
Adding to 2500300055305 its reverse (5035500030052), we get a palindrome (7535800085357).
The spelling of 2500300055305 in words is "two trillion, five hundred billion, three hundred million, fifty-five thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •