Base | Representation |
---|---|
bin | 11111111110100001101… |
… | …01110000010101100101 |
3 | 10220000222201022000101201 |
4 | 33333100311300111211 |
5 | 121000134411204104 |
6 | 2200424543322501 |
7 | 142244213263201 |
oct | 17772065602545 |
9 | 3800881260351 |
10 | 1098720413029 |
11 | 393a680363a8 |
12 | 158b332b0431 |
13 | 7c7bb969715 |
14 | 3b26d57bb01 |
15 | 1d8a84940a4 |
hex | ffd0d70565 |
1098720413029 has 2 divisors, whose sum is σ = 1098720413030. Its totient is φ = 1098720413028.
The previous prime is 1098720413009. The next prime is 1098720413041. The reversal of 1098720413029 is 9203140278901.
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., 946621973025 + 152098440004 = 972945^2 + 389998^2 .
It is a cyclic number.
It is not a de Polignac number, because 1098720413029 - 27 = 1098720412901 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1098720413029.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1098720413009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 549360206514 + 549360206515.
It is an arithmetic number, because the mean of its divisors is an integer number (549360206515).
Almost surely, 21098720413029 is an apocalyptic number.
It is an amenable number.
1098720413029 is a deficient number, since it is larger than the sum of its proper divisors (1).
1098720413029 is an equidigital number, since it uses as much as digits as its factorization.
1098720413029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 217728, while the sum is 46.
The spelling of 1098720413029 in words is "one trillion, ninety-eight billion, seven hundred twenty million, four hundred thirteen thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •