Base | Representation |
---|---|
bin | 111010010100100100101011… |
… | …001011101000110001100101 |
3 | 1020122012012112112001220001120 |
4 | 322110210223023220301211 |
5 | 232110000423341332201 |
6 | 2305310404300444153 |
7 | 105012355446265110 |
oct | 7224445313506145 |
9 | 1218165475056046 |
10 | 256500466355301 |
11 | 74802267338993 |
12 | 24927613249659 |
13 | b017b7599489c |
14 | 474a990159577 |
15 | 1e9c2746d9536 |
hex | e9492b2e8c65 |
256500466355301 has 64 divisors (see below), whose sum is σ = 395114233927680. Its totient is φ = 144979858679040.
The previous prime is 256500466355299. The next prime is 256500466355363. The reversal of 256500466355301 is 103553664005652.
It is not a de Polignac number, because 256500466355301 - 21 = 256500466355299 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (256500466355501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 6234647191 + ... + 6234688331.
It is an arithmetic number, because the mean of its divisors is an integer number (6173659905120).
Almost surely, 2256500466355301 is an apocalyptic number.
256500466355301 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
256500466355301 is a deficient number, since it is larger than the sum of its proper divisors (138613767572379).
256500466355301 is a wasteful number, since it uses less digits than its factorization.
256500466355301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45434.
The product of its (nonzero) digits is 9720000, while the sum is 51.
The spelling of 256500466355301 in words is "two hundred fifty-six trillion, five hundred billion, four hundred sixty-six million, three hundred fifty-five thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •