Base | Representation |
---|---|
bin | 11110000100001000100… |
… | …00101010100100010011 |
3 | 10122202101022122200021122 |
4 | 33002010100222210103 |
5 | 113411101321042321 |
6 | 2110320405112455 |
7 | 134426656401461 |
oct | 17020420524423 |
9 | 3582338580248 |
10 | 1033011112211 |
11 | 36910892a111 |
12 | 1482553b872b |
13 | 76549436030 |
14 | 37dd874b831 |
15 | 1bd0e8cb8ab |
hex | f08442a913 |
1033011112211 has 8 divisors (see below), whose sum is σ = 1113848638560. Its totient is φ = 952370033472.
The previous prime is 1033011112141. The next prime is 1033011112307. The reversal of 1033011112211 is 1122111103301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-1033011112211 is a prime.
It is a super-2 number, since 2×10330111122112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1033011112211.
It is not an unprimeable number, because it can be changed into a prime (1033011112711) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 49100975 + ... + 49122008.
It is an arithmetic number, because the mean of its divisors is an integer number (139231079820).
Almost surely, 21033011112211 is an apocalyptic number.
1033011112211 is a deficient number, since it is larger than the sum of its proper divisors (80837526349).
1033011112211 is an equidigital number, since it uses as much as digits as its factorization.
1033011112211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98223805.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 1033011112211 its reverse (1122111103301), we get a palindrome (2155122215512).
The spelling of 1033011112211 in words is "one trillion, thirty-three billion, eleven million, one hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •