Base | Representation |
---|---|
bin | 1111000100101001110001… |
… | …01001111100000100110100 |
3 | 11100100122120220002221010211 |
4 | 13202110320221330010310 |
5 | 13321022344031010200 |
6 | 154254411204155204 |
7 | 6660443165106301 |
oct | 742247051740464 |
9 | 140318526087124 |
10 | 33145213141300 |
11 | a6198957a7107 |
12 | 3873920998b04 |
13 | 1565770898620 |
14 | 828345db60a8 |
15 | 3c72b2c48aba |
hex | 1e2538a7c134 |
33145213141300 has 144 divisors (see below), whose sum is σ = 77886078221952. Its totient is φ = 12170623449600.
The previous prime is 33145213141297. The next prime is 33145213141333. The reversal of 33145213141300 is 314131254133.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 591819099 + ... + 591875101.
It is an arithmetic number, because the mean of its divisors is an integer number (540875543208).
Almost surely, 233145213141300 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 33145213141300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (38943039110976).
33145213141300 is an abundant number, since it is smaller than the sum of its proper divisors (44740865080652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
33145213141300 is a wasteful number, since it uses less digits than its factorization.
33145213141300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58538 (or 58531 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 31.
Adding to 33145213141300 its reverse (314131254133), we get a palindrome (33459344395433).
The spelling of 33145213141300 in words is "thirty-three trillion, one hundred forty-five billion, two hundred thirteen million, one hundred forty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •