Base | Representation |
---|---|
bin | 11001011001111… |
… | …01010100111000 |
3 | 112212000012212111 |
4 | 30230331110320 |
5 | 414024041440 |
6 | 33051422104 |
7 | 5165265064 |
oct | 1454752470 |
9 | 485005774 |
10 | 213112120 |
11 | aa329321 |
12 | 5b454934 |
13 | 351c8560 |
14 | 20436aa4 |
15 | 13a994ea |
hex | cb3d538 |
213112120 has 32 divisors (see below), whose sum is σ = 516388320. Its totient is φ = 78687360.
The previous prime is 213112117. The next prime is 213112127. The reversal of 213112120 is 21211312.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a self number, because there is not a number n which added to its sum of digits gives 213112120.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213112127) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 204396 + ... + 205435.
It is an arithmetic number, because the mean of its divisors is an integer number (16137135).
Almost surely, 2213112120 is an apocalyptic number.
213112120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
213112120 is an abundant number, since it is smaller than the sum of its proper divisors (303276200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213112120 is a wasteful number, since it uses less digits than its factorization.
213112120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 409855 (or 409851 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 213112120 is about 14598.3601818834. The cubic root of 213112120 is about 597.3140309296.
Adding to 213112120 its reverse (21211312), we get a palindrome (234323432).
The spelling of 213112120 in words is "two hundred thirteen million, one hundred twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •