Base | Representation |
---|---|
bin | 11110010101110000000… |
… | …10101011000100111101 |
3 | 10200122210111211111120102 |
4 | 33022320002223010331 |
5 | 114034434231402414 |
6 | 2114523133330445 |
7 | 135213242021522 |
oct | 17127002530475 |
9 | 3618714744512 |
10 | 1042469794109 |
11 | 372122026897 |
12 | 14a055036a25 |
13 | 773c5c32923 |
14 | 38654a41149 |
15 | 1c1b4eadede |
hex | f2b80ab13d |
1042469794109 has 2 divisors, whose sum is σ = 1042469794110. Its totient is φ = 1042469794108.
The previous prime is 1042469794087. The next prime is 1042469794123. The reversal of 1042469794109 is 9014979642401.
1042469794109 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., 600504106084 + 441965688025 = 774922^2 + 664805^2 .
It is a cyclic number.
It is not a de Polignac number, because 1042469794109 - 220 = 1042468745533 is a prime.
It is a super-2 number, since 2×10424697941092 (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 (1042469794129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 521234897054 + 521234897055.
It is an arithmetic number, because the mean of its divisors is an integer number (521234897055).
Almost surely, 21042469794109 is an apocalyptic number.
It is an amenable number.
1042469794109 is a deficient number, since it is larger than the sum of its proper divisors (1).
1042469794109 is an equidigital number, since it uses as much as digits as its factorization.
1042469794109 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3919104, while the sum is 56.
The spelling of 1042469794109 in words is "one trillion, forty-two billion, four hundred sixty-nine million, seven hundred ninety-four thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •