Base | Representation |
---|---|
bin | 100000101011110000101… |
… | …100100110001110100101 |
3 | 21221201100101020012022011 |
4 | 200223300230212032211 |
5 | 243244312323320034 |
6 | 4435445301434221 |
7 | 321161151534154 |
oct | 40536054461645 |
9 | 7851311205264 |
10 | 2246011151269 |
11 | 796589817a36 |
12 | 30336070b971 |
13 | 133a4b107432 |
14 | 7a9c961159b |
15 | 3d655a25864 |
hex | 20af0b263a5 |
2246011151269 has 2 divisors, whose sum is σ = 2246011151270. Its totient is φ = 2246011151268.
The previous prime is 2246011151233. The next prime is 2246011151287. The reversal of 2246011151269 is 9621511106422.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2052729580225 + 193281571044 = 1432735^2 + 439638^2 .
It is a cyclic number.
It is not a de Polignac number, because 2246011151269 - 215 = 2246011118501 is a prime.
It is a super-2 number, since 2×22460111512692 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2246011151669) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1123005575634 + 1123005575635.
It is an arithmetic number, because the mean of its divisors is an integer number (1123005575635).
Almost surely, 22246011151269 is an apocalyptic number.
It is an amenable number.
2246011151269 is a deficient number, since it is larger than the sum of its proper divisors (1).
2246011151269 is an equidigital number, since it uses as much as digits as its factorization.
2246011151269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51840, while the sum is 40.
The spelling of 2246011151269 in words is "two trillion, two hundred forty-six billion, eleven million, one hundred fifty-one thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •