Base | Representation |
---|---|
bin | 11110000100010110101… |
… | …11000001100111100001 |
3 | 10122202200121202222110021 |
4 | 33002023113001213201 |
5 | 113411322314020001 |
6 | 2110340302033441 |
7 | 134432633655505 |
oct | 17021327014741 |
9 | 3582617688407 |
10 | 1033130220001 |
11 | 36916a091600 |
12 | 148289278881 |
13 | 76568009b09 |
14 | 3800a4b4305 |
15 | 1bd1a0a7ba1 |
hex | f08b5c19e1 |
1033130220001 has 12 divisors (see below), whose sum is σ = 1142389374336. Its totient is φ = 933585264920.
The previous prime is 1033130219987. The next prime is 1033130220047. The reversal of 1033130220001 is 1000220313301.
It is not a de Polignac number, because 1033130220001 - 29 = 1033130219489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1033130220071) 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 11 ways as a sum of consecutive naturals, for example, 25543465 + ... + 25583878.
It is an arithmetic number, because the mean of its divisors is an integer number (95199114528).
Almost surely, 21033130220001 is an apocalyptic number.
1033130220001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1033130220001 is a deficient number, since it is larger than the sum of its proper divisors (109259154335).
1033130220001 is a wasteful number, since it uses less digits than its factorization.
1033130220001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51127532 (or 51127521 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 1033130220001 its reverse (1000220313301), we get a palindrome (2033350533302).
The spelling of 1033130220001 in words is "one trillion, thirty-three billion, one hundred thirty million, two hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •