Base | Representation |
---|---|
bin | 1110111100010001100… |
… | …1101010100010101100 |
3 | 220112120201211020202101 |
4 | 3233010121222202230 |
5 | 13201204210221102 |
6 | 313531523504444 |
7 | 24355135061203 |
oct | 3570431524254 |
9 | 815521736671 |
10 | 256698132652 |
11 | 99957449475 |
12 | 418bb828124 |
13 | 1b28b9920b0 |
14 | c5d223023a |
15 | 6a25da5e87 |
hex | 3bc466a8ac |
256698132652 has 48 divisors (see below), whose sum is σ = 513457993440. Its totient is φ = 111240594432.
The previous prime is 256698132643. The next prime is 256698132661. The reversal of 256698132652 is 256231896652.
256698132652 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (256698132643) and next prime (256698132661).
It is a junction number, because it is equal to n+sod(n) for n = 256698132593 and 256698132602.
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 15 ways as a sum of consecutive naturals, for example, 23878 + ... + 716914.
It is an arithmetic number, because the mean of its divisors is an integer number (10697041530).
Almost surely, 2256698132652 is an apocalyptic number.
It is an amenable number.
256698132652 is an abundant number, since it is smaller than the sum of its proper divisors (256759860788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
256698132652 is a wasteful number, since it uses less digits than its factorization.
256698132652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 693490 (or 693488 counting only the distinct ones).
The product of its digits is 9331200, while the sum is 55.
The spelling of 256698132652 in words is "two hundred fifty-six billion, six hundred ninety-eight million, one hundred thirty-two thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •