Base | Representation |
---|---|
bin | 100110010001110110010… |
… | …010101101010001000101 |
3 | 100022110210101111011210012 |
4 | 212101312102231101011 |
5 | 321044233134210040 |
6 | 5332234230440005 |
7 | 361022233116605 |
oct | 46216622552105 |
9 | 10273711434705 |
10 | 2630504600645 |
11 | 9246552a7339 |
12 | 365986803005 |
13 | 161094c8cb1c |
14 | 914621b0c05 |
15 | 4865adea865 |
hex | 264764ad445 |
2630504600645 has 8 divisors (see below), whose sum is σ = 3158452579320. Its totient is φ = 2103172308160.
The previous prime is 2630504600641. The next prime is 2630504600651. The reversal of 2630504600645 is 5460064050362.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 34068668929 + 2596435931716 = 184577^2 + 1611346^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2630504600645 - 22 = 2630504600641 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2630504600641) by changing a digit.
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, 153912146 + ... + 153929235.
It is an arithmetic number, because the mean of its divisors is an integer number (394806572415).
Almost surely, 22630504600645 is an apocalyptic number.
It is an amenable number.
2630504600645 is a deficient number, since it is larger than the sum of its proper divisors (527947978675).
2630504600645 is a wasteful number, since it uses less digits than its factorization.
2630504600645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 307843095.
The product of its (nonzero) digits is 518400, while the sum is 41.
The spelling of 2630504600645 in words is "two trillion, six hundred thirty billion, five hundred four million, six hundred thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •