Base | Representation |
---|---|
bin | 100000111101000111011… |
… | …001001010111010110001 |
3 | 22000111110001010111210222 |
4 | 200331013121022322301 |
5 | 244100443224430044 |
6 | 4452210325302425 |
7 | 322421012345444 |
oct | 40750731127261 |
9 | 8014401114728 |
10 | 2264645545649 |
11 | 7a348140a273 |
12 | 306aa1264a15 |
13 | 13572a8b67b6 |
14 | 7b8763b965b |
15 | 3dd969428ee |
hex | 20f4764aeb1 |
2264645545649 has 2 divisors, whose sum is σ = 2264645545650. Its totient is φ = 2264645545648.
The previous prime is 2264645545559. The next prime is 2264645545697. The reversal of 2264645545649 is 9465455464622.
2264645545649 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2133445839424 + 131199706225 = 1460632^2 + 362215^2 .
It is a cyclic number.
It is not a de Polignac number, because 2264645545649 - 224 = 2264628768433 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2264645545591 and 2264645545600.
It is not a weakly prime, because it can be changed into another prime (2264645565649) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1132322772824 + 1132322772825.
It is an arithmetic number, because the mean of its divisors is an integer number (1132322772825).
Almost surely, 22264645545649 is an apocalyptic number.
It is an amenable number.
2264645545649 is a deficient number, since it is larger than the sum of its proper divisors (1).
2264645545649 is an equidigital number, since it uses as much as digits as its factorization.
2264645545649 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 248832000, while the sum is 62.
The spelling of 2264645545649 in words is "two trillion, two hundred sixty-four billion, six hundred forty-five million, five hundred forty-five thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •