Base | Representation |
---|---|
bin | 11110000110100101110… |
… | …11110011100101111101 |
3 | 10122212210022100011121101 |
4 | 33003102323303211331 |
5 | 113421302221403341 |
6 | 2111055355533101 |
7 | 134504454545656 |
oct | 17032273634575 |
9 | 3585708304541 |
10 | 1034331044221 |
11 | 369725a00612 |
12 | 14856345a191 |
13 | 766c9a2c4a7 |
14 | 380c1b7a52d |
15 | 1bd8a707831 |
hex | f0d2ef397d |
1034331044221 has 2 divisors, whose sum is σ = 1034331044222. Its totient is φ = 1034331044220.
The previous prime is 1034331044213. The next prime is 1034331044309. The reversal of 1034331044221 is 1224401334301.
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., 614673248121 + 419657796100 = 784011^2 + 647810^2 .
It is a cyclic number.
It is not a de Polignac number, because 1034331044221 - 23 = 1034331044213 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1034331044221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1034331044821) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 517165522110 + 517165522111.
It is an arithmetic number, because the mean of its divisors is an integer number (517165522111).
Almost surely, 21034331044221 is an apocalyptic number.
It is an amenable number.
1034331044221 is a deficient number, since it is larger than the sum of its proper divisors (1).
1034331044221 is an equidigital number, since it uses as much as digits as its factorization.
1034331044221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 1034331044221 its reverse (1224401334301), we get a palindrome (2258732378522).
The spelling of 1034331044221 in words is "one trillion, thirty-four billion, three hundred thirty-one million, forty-four thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •