Base | Representation |
---|---|
bin | 11110000100001000100… |
… | …01011101110010011101 |
3 | 10122202101100001100002002 |
4 | 33002010101131302131 |
5 | 113411101344301023 |
6 | 2110320413412045 |
7 | 134426661234236 |
oct | 17020421356235 |
9 | 3582340040062 |
10 | 1033011322013 |
11 | 369108a62800 |
12 | 14825549a025 |
13 | 765494aa688 |
14 | 37dd87a408d |
15 | 1bd0e91db28 |
hex | f08445dc9d |
1033011322013 has 24 divisors (see below), whose sum is σ = 1148572763520. Its totient is φ = 928317218400.
The previous prime is 1033011321967. The next prime is 1033011322019. The reversal of 1033011322013 is 3102231103301.
It is not a de Polignac number, because 1033011322013 - 26 = 1033011321949 is a prime.
It is a super-2 number, since 2×10330113220132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1033011322019) 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 23 ways as a sum of consecutive naturals, for example, 3516248 + ... + 3798686.
It is an arithmetic number, because the mean of its divisors is an integer number (47857198480).
Almost surely, 21033011322013 is an apocalyptic number.
It is an amenable number.
1033011322013 is a deficient number, since it is larger than the sum of its proper divisors (115561441507).
1033011322013 is a wasteful number, since it uses less digits than its factorization.
1033011322013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 282809 (or 282798 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 1033011322013 its reverse (3102231103301), we get a palindrome (4135242425314).
The spelling of 1033011322013 in words is "one trillion, thirty-three billion, eleven million, three hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •