Base | Representation |
---|---|
bin | 1001111001010011… |
… | …1011011000100001 |
3 | 20212010021022200220 |
4 | 2132110323120201 |
5 | 20420002124431 |
6 | 1115325233253 |
7 | 122553026520 |
oct | 23624733041 |
9 | 6763238626 |
10 | 2656286241 |
11 | 114344a194 |
12 | 621702829 |
13 | 33441c70b |
14 | 1b2ad44b7 |
15 | 1082ecb96 |
hex | 9e53b621 |
2656286241 has 16 divisors (see below), whose sum is σ = 4260710400. Its totient is φ = 1437989328.
The previous prime is 2656286239. The next prime is 2656286273. The reversal of 2656286241 is 1426826562.
It is a happy number.
2656286241 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2656286241 - 21 = 2656286239 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2656286193 and 2656286202.
It is not an unprimeable number, because it can be changed into a prime (2656286231) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3328281 + ... + 3329078.
It is an arithmetic number, because the mean of its divisors is an integer number (266294400).
Almost surely, 22656286241 is an apocalyptic number.
2656286241 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2656286241 is a deficient number, since it is larger than the sum of its proper divisors (1604424159).
2656286241 is a wasteful number, since it uses less digits than its factorization.
2656286241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6657388.
The product of its digits is 276480, while the sum is 42.
The square root of 2656286241 is about 51539.1719083650. The cubic root of 2656286241 is about 1384.9208625993.
The spelling of 2656286241 in words is "two billion, six hundred fifty-six million, two hundred eighty-six thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •