Base | Representation |
---|---|
bin | 11001000011000… |
… | …01001000000111 |
3 | 112122100211220010 |
4 | 30201201020013 |
5 | 412242104111 |
6 | 32503241303 |
7 | 5130634302 |
oct | 1441411007 |
9 | 478324803 |
10 | 210113031 |
11 | a8670037 |
12 | 5a449233 |
13 | 346b844b |
14 | 1dc95b39 |
15 | 136a5aa6 |
hex | c861207 |
210113031 has 8 divisors (see below), whose sum is σ = 281870080. Its totient is φ = 139215672.
The previous prime is 210113023. The next prime is 210113051. The reversal of 210113031 is 130311012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 210113031 - 23 = 210113023 is a prime.
It is a super-2 number, since 2×2101130312 = 88294971592013922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 210112998 and 210113016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210113051) 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, 214351 + ... + 215328.
It is an arithmetic number, because the mean of its divisors is an integer number (35233760).
Almost surely, 2210113031 is an apocalyptic number.
210113031 is a deficient number, since it is larger than the sum of its proper divisors (71757049).
210113031 is a wasteful number, since it uses less digits than its factorization.
210113031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 429845.
The product of its (nonzero) digits is 18, while the sum is 12.
The square root of 210113031 is about 14495.2761615638. The cubic root of 210113031 is about 594.4988186000.
Adding to 210113031 its reverse (130311012), we get a palindrome (340424043).
It can be divided in two parts, 21011 and 3031, that added together give a palindrome (24042).
The spelling of 210113031 in words is "two hundred ten million, one hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •