Base | Representation |
---|---|
bin | 1000011001111011… |
… | …1001011010100001 |
3 | 12211020112012020201 |
4 | 2012132321122201 |
5 | 14110044341213 |
6 | 1011515105201 |
7 | 106624530640 |
oct | 20636713241 |
9 | 5736465221 |
10 | 2256246433 |
11 | a58657381 |
12 | 52b742201 |
13 | 29c595c7c |
14 | 17591d357 |
15 | d312c6dd |
hex | 867b96a1 |
2256246433 has 32 divisors (see below), whose sum is σ = 2789867520. Its totient is φ = 1782190080.
The previous prime is 2256246407. The next prime is 2256246439. The reversal of 2256246433 is 3346426522.
2256246433 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 2256246433 - 217 = 2256115361 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2256246392 and 2256246401.
It is not an unprimeable number, because it can be changed into a prime (2256246439) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1281808 + ... + 1283566.
It is an arithmetic number, because the mean of its divisors is an integer number (87183360).
Almost surely, 22256246433 is an apocalyptic number.
2256246433 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
2256246433 is a deficient number, since it is larger than the sum of its proper divisors (533621087).
2256246433 is a wasteful number, since it uses less digits than its factorization.
2256246433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2077.
The product of its digits is 207360, while the sum is 37.
The square root of 2256246433 is about 47499.9624526167. The cubic root of 2256246433 is about 1311.5821904252.
The spelling of 2256246433 in words is "two billion, two hundred fifty-six million, two hundred forty-six thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •