Base | Representation |
---|---|
bin | 11110000100010110110… |
… | …11001010000001100100 |
3 | 10122202200200211000001210 |
4 | 33002023123022001210 |
5 | 113411323103144022 |
6 | 2110340341151420 |
7 | 134432646116124 |
oct | 17021333120144 |
9 | 3582620730053 |
10 | 1033131303012 |
11 | 36916a761256 |
12 | 1482896bb570 |
13 | 765682c8a53 |
14 | 3800a6b6c84 |
15 | 1bd1a21da0c |
hex | f08b6ca064 |
1033131303012 has 48 divisors (see below), whose sum is σ = 2424811536000. Its totient is φ = 342355495680.
The previous prime is 1033131302999. The next prime is 1033131303059. The reversal of 1033131303012 is 2103031313301.
It is a self number, because there is not a number n which added to its sum of digits gives 1033131303012.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2637064 + ... + 3003392.
It is an arithmetic number, because the mean of its divisors is an integer number (50516907000).
Almost surely, 21033131303012 is an apocalyptic number.
1033131303012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1033131303012 is an abundant number, since it is smaller than the sum of its proper divisors (1391680232988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1033131303012 is a wasteful number, since it uses less digits than its factorization.
1033131303012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 367716 (or 367714 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 1033131303012 its reverse (2103031313301), we get a palindrome (3136162616313).
The spelling of 1033131303012 in words is "one trillion, thirty-three billion, one hundred thirty-one million, three hundred three thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •