Base | Representation |
---|---|
bin | 111110001111011… |
… | …000100011000001 |
3 | 2200202212212200102 |
4 | 332033120203001 |
5 | 4114310020342 |
6 | 251341132145 |
7 | 34606503314 |
oct | 7617304301 |
9 | 2622785612 |
10 | 1044220097 |
11 | 496487018 |
12 | 25185a055 |
13 | 13845081b |
14 | 9c97c97b |
15 | 61a18832 |
hex | 3e3d88c1 |
1044220097 has 2 divisors, whose sum is σ = 1044220098. Its totient is φ = 1044220096.
The previous prime is 1044220091. The next prime is 1044220141. The reversal of 1044220097 is 7900224401.
1044220097 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 563777536 + 480442561 = 23744^2 + 21919^2 .
It is a cyclic number.
It is not a de Polignac number, because 1044220097 - 210 = 1044219073 is a prime.
It is a super-2 number, since 2×10442200972 = 2180791221957378818, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1044220091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 522110048 + 522110049.
It is an arithmetic number, because the mean of its divisors is an integer number (522110049).
Almost surely, 21044220097 is an apocalyptic number.
It is an amenable number.
1044220097 is a deficient number, since it is larger than the sum of its proper divisors (1).
1044220097 is an equidigital number, since it uses as much as digits as its factorization.
1044220097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4032, while the sum is 29.
The square root of 1044220097 is about 32314.3945788870. The cubic root of 1044220097 is about 1014.5279489371.
Adding to 1044220097 its reverse (7900224401), we get a palindrome (8944444498).
The spelling of 1044220097 in words is "one billion, forty-four million, two hundred twenty thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •