Base | Representation |
---|---|
bin | 11111010010000100001… |
… | …00001110001100011001 |
3 | 10210202101011022220221112 |
4 | 33221002010032030121 |
5 | 120102243124230334 |
6 | 2141440202350105 |
7 | 140440535120051 |
oct | 17510204161431 |
9 | 3722334286845 |
10 | 1074850226969 |
11 | 384928a28302 |
12 | 1543911bb335 |
13 | 7a48652227c |
14 | 3a047294561 |
15 | 1ce5ca964ce |
hex | fa4210e319 |
1074850226969 has 2 divisors, whose sum is σ = 1074850226970. Its totient is φ = 1074850226968.
The previous prime is 1074850226953. The next prime is 1074850226993. The reversal of 1074850226969 is 9696220584701.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 982154335369 + 92695891600 = 991037^2 + 304460^2 .
It is a cyclic number.
It is not a de Polignac number, because 1074850226969 - 24 = 1074850226953 is a prime.
It is a super-3 number, since 3×10748502269693 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (1074850226369) 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, 537425113484 + 537425113485.
It is an arithmetic number, because the mean of its divisors is an integer number (537425113485).
Almost surely, 21074850226969 is an apocalyptic number.
It is an amenable number.
1074850226969 is a deficient number, since it is larger than the sum of its proper divisors (1).
1074850226969 is an equidigital number, since it uses as much as digits as its factorization.
1074850226969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13063680, while the sum is 59.
The spelling of 1074850226969 in words is "one trillion, seventy-four billion, eight hundred fifty million, two hundred twenty-six thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •