Base | Representation |
---|---|
bin | 1110101100011010100111… |
… | …00100110010100101011010 |
3 | 11020102001001120122001221210 |
4 | 13112031103210302211122 |
5 | 13213401334411333424 |
6 | 152420044105443550 |
7 | 6543332261533020 |
oct | 726152344624532 |
9 | 136361046561853 |
10 | 32312441121114 |
11 | a3286a16a1610 |
12 | 375a44b1a05b6 |
13 | 150508617523b |
14 | 7d9d053c6710 |
15 | 3b07c27bd729 |
hex | 1d635393295a |
32312441121114 has 128 divisors (see below), whose sum is σ = 81213724956672. Its totient is φ = 8326166365440.
The previous prime is 32312441121097. The next prime is 32312441121127. The reversal of 32312441121114 is 41112114421323.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 31070292 + ... + 32093424.
It is an arithmetic number, because the mean of its divisors is an integer number (634482226224).
Almost surely, 232312441121114 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 32312441121114, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (40606862478336).
32312441121114 is an abundant number, since it is smaller than the sum of its proper divisors (48901283835558).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32312441121114 is a wasteful number, since it uses less digits than its factorization.
32312441121114 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1023700.
The product of its digits is 4608, while the sum is 30.
Adding to 32312441121114 its reverse (41112114421323), we get a palindrome (73424555542437).
The spelling of 32312441121114 in words is "thirty-two trillion, three hundred twelve billion, four hundred forty-one million, one hundred twenty-one thousand, one hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •