Base | Representation |
---|---|
bin | 1110001101001111000110… |
… | …10001010010000001010100 |
3 | 11002121121202200022102202122 |
4 | 13012213203101102001110 |
5 | 13043323243141231400 |
6 | 150235545015555112 |
7 | 6403044555242303 |
oct | 706474321220124 |
9 | 132547680272678 |
10 | 31241110102100 |
11 | 9a5530a220338 |
12 | 36068a068ba98 |
13 | 1458040a86352 |
14 | 7a011369043a |
15 | 3929bdb7a685 |
hex | 1c69e3452054 |
31241110102100 has 72 divisors (see below), whose sum is σ = 68675598647040. Its totient is φ = 12333903304320.
The previous prime is 31241110102087. The next prime is 31241110102127. The reversal of 31241110102100 is 120101114213.
It is a congruent number.
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 23 ways as a sum of consecutive naturals, for example, 21715337 + ... + 23109263.
Almost surely, 231241110102100 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 31241110102100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34337799323520).
31241110102100 is an abundant number, since it is smaller than the sum of its proper divisors (37434488544940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31241110102100 is a wasteful number, since it uses less digits than its factorization.
31241110102100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1396857 (or 1396850 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 31241110102100 its reverse (120101114213), we get a palindrome (31361211216313).
The spelling of 31241110102100 in words is "thirty-one trillion, two hundred forty-one billion, one hundred ten million, one hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •