Base | Representation |
---|---|
bin | 1100011001110111000… |
… | …1011100001110111100 |
3 | 202101001022221222222000 |
4 | 3012131301130032330 |
5 | 11442412144143431 |
6 | 241521424422300 |
7 | 21252553231650 |
oct | 3063561341674 |
9 | 671038858860 |
10 | 213100381116 |
11 | 82414678457 |
12 | 35372a77990 |
13 | 17131438c8c |
14 | a457cdaa60 |
15 | 58236039e6 |
hex | 319dc5c3bc |
213100381116 has 144 divisors (see below), whose sum is σ = 653933978880. Its totient is φ = 58786136640.
The previous prime is 213100381097. The next prime is 213100381147. The reversal of 213100381116 is 611183001312.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 213100381116.
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, 468211 + ... + 803381.
Almost surely, 2213100381116 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 213100381116, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (326966989440).
213100381116 is an abundant number, since it is smaller than the sum of its proper divisors (440833597764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213100381116 is a wasteful number, since it uses less digits than its factorization.
213100381116 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 335249 (or 335212 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 27.
Adding to 213100381116 its reverse (611183001312), we get a palindrome (824283382428).
The spelling of 213100381116 in words is "two hundred thirteen billion, one hundred million, three hundred eighty-one thousand, one hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •