Base | Representation |
---|---|
bin | 111100100010001… |
… | …1010011101101110 |
3 | 12020120001122201201 |
4 | 1321010122131232 |
5 | 13124441400420 |
6 | 533315400114 |
7 | 101222626132 |
oct | 17104323556 |
9 | 5216048651 |
10 | 2031200110 |
11 | 952617785 |
12 | 4882b303a |
13 | 264a7c674 |
14 | 153a9b3c2 |
15 | bd4c710a |
hex | 7911a76e |
2031200110 has 8 divisors (see below), whose sum is σ = 3656160216. Its totient is φ = 812480040.
The previous prime is 2031200099. The next prime is 2031200117. The reversal of 2031200110 is 110021302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 203120011 = 2031200110 / (2 + 0 + 3 + 1 + 2 + 0 + 0 + 1 + 1 + 0).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2031200117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 101559996 + ... + 101560015.
It is an arithmetic number, because the mean of its divisors is an integer number (457020027).
Almost surely, 22031200110 is an apocalyptic number.
2031200110 is a deficient number, since it is larger than the sum of its proper divisors (1624960106).
2031200110 is a wasteful number, since it uses less digits than its factorization.
2031200110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 203120018.
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 2031200110 is about 45068.8374600455. The cubic root of 2031200110 is about 1266.4388861729.
Adding to 2031200110 its reverse (110021302), we get a palindrome (2141221412).
The spelling of 2031200110 in words is "two billion, thirty-one million, two hundred thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •