Base | Representation |
---|---|
bin | 1001011001011110001101… |
… | …1100000001110000010010 |
3 | 1100120211211022121220010220 |
4 | 2112113203130001300102 |
5 | 2323244404300402010 |
6 | 33551002341133510 |
7 | 2114356425554232 |
oct | 226274334016022 |
9 | 40524738556126 |
10 | 10333212122130 |
11 | 3324321947237 |
12 | 11aa78b9ba296 |
13 | 59c5579734b1 |
14 | 27a1b713bcc2 |
15 | 12dbcd220970 |
hex | 965e3701c12 |
10333212122130 has 32 divisors (see below), whose sum is σ = 24891220954368. Its totient is φ = 2745355248000.
The previous prime is 10333212122099. The next prime is 10333212122171. The reversal of 10333212122130 is 3122121233301.
It is a self number, because there is not a number n which added to its sum of digits gives 10333212122130.
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 15 ways as a sum of consecutive naturals, for example, 635490771 + ... + 635507030.
It is an arithmetic number, because the mean of its divisors is an integer number (777850654824).
Almost surely, 210333212122130 is an apocalyptic number.
10333212122130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10333212122130 is an abundant number, since it is smaller than the sum of its proper divisors (14558008832238).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10333212122130 is a wasteful number, since it uses less digits than its factorization.
10333212122130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1270998082.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 10333212122130 its reverse (3122121233301), we get a palindrome (13455333355431).
The spelling of 10333212122130 in words is "ten trillion, three hundred thirty-three billion, two hundred twelve million, one hundred twenty-two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •