Base | Representation |
---|---|
bin | 101000010101100110… |
… | …010111011110000100 |
3 | 11010210111021012211210 |
4 | 220111212113132010 |
5 | 1202200341131400 |
6 | 31521451331420 |
7 | 3062212240242 |
oct | 502546273604 |
9 | 133714235753 |
10 | 43312052100 |
11 | 17406584889 |
12 | 8489150b70 |
13 | 41132c44c5 |
14 | 214c403792 |
15 | 11d766a950 |
hex | a15997784 |
43312052100 has 144 divisors (see below), whose sum is σ = 130877873280. Its totient is φ = 11038156800.
The previous prime is 43312052089. The next prime is 43312052137. The reversal of 43312052100 is 125021334.
It is a super-2 number, since 2×433120521002 (a number of 22 digits) contains 22 as substring.
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 47 ways as a sum of consecutive naturals, for example, 11514220 + ... + 11517980.
It is an arithmetic number, because the mean of its divisors is an integer number (908874120).
Almost surely, 243312052100 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 43312052100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (65438936640).
43312052100 is an abundant number, since it is smaller than the sum of its proper divisors (87565821180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
43312052100 is a wasteful number, since it uses less digits than its factorization.
43312052100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5470 (or 5463 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 21.
Adding to 43312052100 its reverse (125021334), we get a palindrome (43437073434).
The spelling of 43312052100 in words is "forty-three billion, three hundred twelve million, fifty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •