Base | Representation |
---|---|
bin | 111010010110001111100100… |
… | …110100101100000011110011 |
3 | 1020122121011210222211210201002 |
4 | 322112033210310230003303 |
5 | 232113341013003120230 |
6 | 2305435230213432215 |
7 | 105023561055512141 |
oct | 7226174464540363 |
9 | 1218534728753632 |
10 | 256615250051315 |
11 | 74846a09787681 |
12 | 2494590803b66b |
13 | b02593927803c |
14 | 475235c7b6591 |
15 | 1ea024175d545 |
hex | e963e4d2c0f3 |
256615250051315 has 4 divisors (see below), whose sum is σ = 307938300061584. Its totient is φ = 205292200041048.
The previous prime is 256615250051257. The next prime is 256615250051359. The reversal of 256615250051315 is 513150052516652.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-256615250051315 is a prime.
It is a super-2 number, since 2×2566152500513152 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 256615250051315.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25661525005127 + ... + 25661525005136.
It is an arithmetic number, because the mean of its divisors is an integer number (76984575015396).
Almost surely, 2256615250051315 is an apocalyptic number.
256615250051315 is a deficient number, since it is larger than the sum of its proper divisors (51323050010269).
256615250051315 is an equidigital number, since it uses as much as digits as its factorization.
256615250051315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51323050010268.
The product of its (nonzero) digits is 1350000, while the sum is 47.
The spelling of 256615250051315 in words is "two hundred fifty-six trillion, six hundred fifteen billion, two hundred fifty million, fifty-one thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •