Base | Representation |
---|---|
bin | 1000111100101110… |
… | …1111110101111001 |
3 | 20012102012111022012 |
4 | 2033023233311321 |
5 | 14404432041213 |
6 | 1034211535305 |
7 | 113346355013 |
oct | 21713576571 |
9 | 6172174265 |
10 | 2402221433 |
11 | 1022a9a577 |
12 | 5705ba535 |
13 | 2c38b5b01 |
14 | 18b07b1b3 |
15 | e0d644a8 |
hex | 8f2efd79 |
2402221433 has 6 divisors (see below), whose sum is σ = 2535308874. Its totient is φ = 2275788384.
The previous prime is 2402221373. The next prime is 2402221463. The reversal of 2402221433 is 3341222042.
It can be written as a sum of positive squares in only one way, i.e., 1403851024 + 998370409 = 37468^2 + 31597^2 .
It is not a de Polignac number, because 2402221433 - 214 = 2402205049 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2402221399 and 2402221408.
It is not an unprimeable number, because it can be changed into a prime (2402221463) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3326816 + ... + 3327537.
It is an arithmetic number, because the mean of its divisors is an integer number (422551479).
Almost surely, 22402221433 is an apocalyptic number.
It is an amenable number.
2402221433 is a deficient number, since it is larger than the sum of its proper divisors (133087441).
2402221433 is an equidigital number, since it uses as much as digits as its factorization.
2402221433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6654391 (or 6654372 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 23.
The square root of 2402221433 is about 49012.4620173278. The cubic root of 2402221433 is about 1339.2788562376.
Adding to 2402221433 its reverse (3341222042), we get a palindrome (5743443475).
The spelling of 2402221433 in words is "two billion, four hundred two million, two hundred twenty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •