Base | Representation |
---|---|
bin | 1000010110101000… |
… | …1011000110010001 |
3 | 12210021112000010102 |
4 | 2011222023012101 |
5 | 14043030101413 |
6 | 1010302542145 |
7 | 106366204616 |
oct | 20552130621 |
9 | 5707460112 |
10 | 2242425233 |
11 | a508772a4 |
12 | 526b97955 |
13 | 299767049 |
14 | 173b6250d |
15 | d1cec458 |
hex | 85a8b191 |
2242425233 has 2 divisors, whose sum is σ = 2242425234. Its totient is φ = 2242425232.
The previous prime is 2242425197. The next prime is 2242425247. The reversal of 2242425233 is 3325242422.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1509477904 + 732947329 = 38852^2 + 27073^2 .
It is a cyclic number.
It is not a de Polignac number, because 2242425233 - 216 = 2242359697 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2242425196 and 2242425205.
It is not a weakly prime, because it can be changed into another prime (2242925233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1121212616 + 1121212617.
It is an arithmetic number, because the mean of its divisors is an integer number (1121212617).
Almost surely, 22242425233 is an apocalyptic number.
It is an amenable number.
2242425233 is a deficient number, since it is larger than the sum of its proper divisors (1).
2242425233 is an equidigital number, since it uses as much as digits as its factorization.
2242425233 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 23040, while the sum is 29.
The square root of 2242425233 is about 47354.2525334315. The cubic root of 2242425233 is about 1308.8985619709.
Adding to 2242425233 its reverse (3325242422), we get a palindrome (5567667655).
The spelling of 2242425233 in words is "two billion, two hundred forty-two million, four hundred twenty-five thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •