Base | Representation |
---|---|
bin | 1110111011100101100… |
… | …0101001001101000100 |
3 | 220112002212001120111022 |
4 | 3232321120221031010 |
5 | 13200314402100102 |
6 | 313501322330312 |
7 | 24350432131136 |
oct | 3567130511504 |
9 | 815085046438 |
10 | 256513315652 |
11 | 99872096750 |
12 | 41869959998 |
13 | 1b25c5c2819 |
14 | c5b5881056 |
15 | 6a14a4a5a2 |
hex | 3bb9629344 |
256513315652 has 24 divisors (see below), whose sum is σ = 489792405312. Its totient is φ = 116576684000.
The previous prime is 256513315627. The next prime is 256513315777.
256513315652 is nontrivially palindromic in base 10.
256513315652 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2565133156522 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (44).
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, 249599 + ... + 758502.
It is an arithmetic number, because the mean of its divisors is an integer number (20408016888).
Almost surely, 2256513315652 is an apocalyptic number.
256513315652 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
256513315652 is a deficient number, since it is larger than the sum of its proper divisors (233279089660).
256513315652 is a wasteful number, since it uses less digits than its factorization.
256513315652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1013899 (or 1013897 counting only the distinct ones).
The product of its digits is 810000, while the sum is 44.
The spelling of 256513315652 in words is "two hundred fifty-six billion, five hundred thirteen million, three hundred fifteen thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •