Base | Representation |
---|---|
bin | 1000010111010001… |
… | …0001010111000001 |
3 | 12210110111111020201 |
4 | 2011310101113001 |
5 | 14044214303241 |
6 | 1010435405201 |
7 | 106430541232 |
oct | 20564212701 |
9 | 5713444221 |
10 | 2245072321 |
11 | a52315078 |
12 | 527a53801 |
13 | 29a182b7b |
14 | 174251089 |
15 | d2171931 |
hex | 85d115c1 |
2245072321 has 2 divisors, whose sum is σ = 2245072322. Its totient is φ = 2245072320.
The previous prime is 2245072267. The next prime is 2245072331. The reversal of 2245072321 is 1232705422.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2116000000 + 129072321 = 46000^2 + 11361^2 .
It is a cyclic number.
It is not a de Polignac number, because 2245072321 - 217 = 2244941249 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2245072321.
It is not a weakly prime, because it can be changed into another prime (2245072331) 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, 1122536160 + 1122536161.
It is an arithmetic number, because the mean of its divisors is an integer number (1122536161).
Almost surely, 22245072321 is an apocalyptic number.
It is an amenable number.
2245072321 is a deficient number, since it is larger than the sum of its proper divisors (1).
2245072321 is an equidigital number, since it uses as much as digits as its factorization.
2245072321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6720, while the sum is 28.
The square root of 2245072321 is about 47382.1941345058. The cubic root of 2245072321 is about 1309.4133925483.
Adding to 2245072321 its reverse (1232705422), we get a palindrome (3477777743).
The spelling of 2245072321 in words is "two billion, two hundred forty-five million, seventy-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •