Base | Representation |
---|---|
bin | 11110000100001001110… |
… | …10101100110001110001 |
3 | 10122202102002101111122112 |
4 | 33002010322230301301 |
5 | 113411112131200223 |
6 | 2110321441215105 |
7 | 134430152144234 |
oct | 17020472546161 |
9 | 3582362344575 |
10 | 1033022131313 |
11 | 369114075a07 |
12 | 148259031495 |
13 | 7654b7c3703 |
14 | 37dd9db941b |
15 | 1bd10856778 |
hex | f084eacc71 |
1033022131313 has 4 divisors (see below), whose sum is σ = 1033024541808. Its totient is φ = 1033019720820.
The previous prime is 1033022131303. The next prime is 1033022131327. The reversal of 1033022131313 is 3131312203301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1033022131313 - 26 = 1033022131249 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1033022131303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 369023 + ... + 1483988.
It is an arithmetic number, because the mean of its divisors is an integer number (258256135452).
Almost surely, 21033022131313 is an apocalyptic number.
It is an amenable number.
1033022131313 is a deficient number, since it is larger than the sum of its proper divisors (2410495).
1033022131313 is an equidigital number, since it uses as much as digits as its factorization.
1033022131313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2410494.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 1033022131313 its reverse (3131312203301), we get a palindrome (4164334334614).
The spelling of 1033022131313 in words is "one trillion, thirty-three billion, twenty-two million, one hundred thirty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •