Base | Representation |
---|---|
bin | 1111000111100000001000… |
… | …11011100110001010110010 |
3 | 11100201000022021102100210110 |
4 | 13203300010123212022302 |
5 | 13324123403012323010 |
6 | 154411402402042150 |
7 | 10000510351022622 |
oct | 743600433461262 |
9 | 140630267370713 |
10 | 33243121214130 |
11 | a657368308383 |
12 | 388a8a6049356 |
13 | 1571a74b85829 |
14 | 82cd9328c882 |
15 | 3c9ae34b3120 |
hex | 1e3c046e62b2 |
33243121214130 has 32 divisors (see below), whose sum is σ = 79783884324864. Its totient is φ = 8864788611456.
The previous prime is 33243121214081. The next prime is 33243121214159. The reversal of 33243121214130 is 3141212134233.
It is a super-2 number, since 2×332431212141302 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3701742 + ... + 8954838.
It is an arithmetic number, because the mean of its divisors is an integer number (2493246385152).
Almost surely, 233243121214130 is an apocalyptic number.
33243121214130 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
33243121214130 is an abundant number, since it is smaller than the sum of its proper divisors (46540763110734).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
33243121214130 is a wasteful number, since it uses less digits than its factorization.
33243121214130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5464050.
The product of its (nonzero) digits is 10368, while the sum is 30.
Adding to 33243121214130 its reverse (3141212134233), we get a palindrome (36384333348363).
The spelling of 33243121214130 in words is "thirty-three trillion, two hundred forty-three billion, one hundred twenty-one million, two hundred fourteen thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.723 sec. • engine limits •