Base | Representation |
---|---|
bin | 1000011100010010… |
… | …1001011011100001 |
3 | 12211221010222000020 |
4 | 2013010221123201 |
5 | 14120113024213 |
6 | 1012511144053 |
7 | 110104615152 |
oct | 20704513341 |
9 | 5757128006 |
10 | 2266142433 |
11 | a631a6395 |
12 | 532b15029 |
13 | 2a164c3a9 |
14 | 176d77929 |
15 | d3e34923 |
hex | 871296e1 |
2266142433 has 4 divisors (see below), whose sum is σ = 3021523248. Its totient is φ = 1510761620.
The previous prime is 2266142399. The next prime is 2266142467. The reversal of 2266142433 is 3342416622.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (2266142399) and next prime (2266142467).
It is a cyclic number.
It is not a de Polignac number, because 2266142433 - 29 = 2266141921 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2266142394 and 2266142403.
It is not an unprimeable number, because it can be changed into a prime (2266142233) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 377690403 + ... + 377690408.
It is an arithmetic number, because the mean of its divisors is an integer number (755380812).
Almost surely, 22266142433 is an apocalyptic number.
It is an amenable number.
2266142433 is a deficient number, since it is larger than the sum of its proper divisors (755380815).
2266142433 is an equidigital number, since it uses as much as digits as its factorization.
2266142433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 755380814.
The product of its digits is 41472, while the sum is 33.
The square root of 2266142433 is about 47604.0169838639. The cubic root of 2266142433 is about 1313.4969468934.
The spelling of 2266142433 in words is "two billion, two hundred sixty-six million, one hundred forty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •