Base | Representation |
---|---|
bin | 1101000001111001000011… |
… | …11101010011100100000000 |
3 | 10202110010120210212222212211 |
4 | 12200330201331103210000 |
5 | 12223414400404110111 |
6 | 140534403333031504 |
7 | 6015026422155652 |
oct | 640744175234400 |
9 | 122403523788784 |
10 | 28652296550656 |
11 | 9147409491369 |
12 | 3269010185594 |
13 | 12cab9131020c |
14 | 710ac84c26d2 |
15 | 34a4a2e4d521 |
hex | 1a0f21f53900 |
28652296550656 has 27 divisors (see below), whose sum is σ = 57192841022961. Its totient is φ = 14326105453056.
The previous prime is 28652296550627. The next prime is 28652296550687. The reversal of 28652296550656 is 65605569225682.
The square root of 28652296550656 is 5352784.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 7884953856256 + 20767342694400 = 2808016^2 + 4557120^2 .
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 28652296550591 and 28652296550600.
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 2 ways as a sum of consecutive naturals, for example, 85477270 + ... + 85811818.
Almost surely, 228652296550656 is an apocalyptic number.
28652296550656 is the 5352784-th square number.
It is an amenable number.
28652296550656 is a deficient number, since it is larger than the sum of its proper divisors (28540544472305).
28652296550656 is an frugal number, since it uses more digits than its factorization.
28652296550656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 669114 (or 334551 counting only the distinct ones).
The product of its (nonzero) digits is 466560000, while the sum is 67.
The spelling of 28652296550656 in words is "twenty-eight trillion, six hundred fifty-two billion, two hundred ninety-six million, five hundred fifty thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •