Base | Representation |
---|---|
bin | 100000001110000011100… |
… | …000011010110101100101 |
3 | 21211200000102222222002122 |
4 | 200032003200122311211 |
5 | 242234001301040034 |
6 | 4413052233115325 |
7 | 315651551324051 |
oct | 40160340326545 |
9 | 7750012888078 |
10 | 2214114471269 |
11 | 784000996178 |
12 | 2b913a558b45 |
13 | 130a36b0199c |
14 | 79241324c61 |
15 | 3c8da64762e |
hex | 2038381ad65 |
2214114471269 has 2 divisors, whose sum is σ = 2214114471270. Its totient is φ = 2214114471268.
The previous prime is 2214114471241. The next prime is 2214114471277. The reversal of 2214114471269 is 9621744114122.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2158636792900 + 55477678369 = 1469230^2 + 235537^2 .
It is a cyclic number.
It is not a de Polignac number, because 2214114471269 - 216 = 2214114405733 is a prime.
It is a super-2 number, since 2×22141144712692 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2214114471209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1107057235634 + 1107057235635.
It is an arithmetic number, because the mean of its divisors is an integer number (1107057235635).
Almost surely, 22214114471269 is an apocalyptic number.
It is an amenable number.
2214114471269 is a deficient number, since it is larger than the sum of its proper divisors (1).
2214114471269 is an equidigital number, since it uses as much as digits as its factorization.
2214114471269 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 193536, while the sum is 44.
The spelling of 2214114471269 in words is "two trillion, two hundred fourteen billion, one hundred fourteen million, four hundred seventy-one thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •