Base | Representation |
---|---|
bin | 11110000100110001010… |
… | …00111100101010110010 |
3 | 10122210021011000111111222 |
4 | 33002120220330222302 |
5 | 113412301333202010 |
6 | 2110414341305042 |
7 | 134441310522422 |
oct | 17023050745262 |
9 | 3583234014458 |
10 | 1033353022130 |
11 | 3692739290a0 |
12 | 14832ba05182 |
13 | 765a2218ab0 |
14 | 3802bd10482 |
15 | 1bd2e918355 |
hex | f098a3cab2 |
1033353022130 has 128 divisors (see below), whose sum is σ = 2334240550656. Its totient is φ = 323566387200.
The previous prime is 1033353022129. The next prime is 1033353022153. The reversal of 1033353022130 is 312203533301.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a self number, because there is not a number n which added to its sum of digits gives 1033353022130.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 2558945 + ... + 2935115.
It is an arithmetic number, because the mean of its divisors is an integer number (18236254302).
Almost surely, 21033353022130 is an apocalyptic number.
1033353022130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1033353022130 is an abundant number, since it is smaller than the sum of its proper divisors (1300887528526).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1033353022130 is a wasteful number, since it uses less digits than its factorization.
1033353022130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 376332.
The product of its (nonzero) digits is 4860, while the sum is 26.
Adding to 1033353022130 its reverse (312203533301), we get a palindrome (1345556555431).
The spelling of 1033353022130 in words is "one trillion, thirty-three billion, three hundred fifty-three million, twenty-two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •