Base | Representation |
---|---|
bin | 11001000011100111110110… |
… | …011011001010101000001111 |
3 | 112110012000202011020201210020 |
4 | 121003213312123022220033 |
5 | 103421004311204330111 |
6 | 1030213122020313223 |
7 | 32132460314434113 |
oct | 3103476633125017 |
9 | 473160664221706 |
10 | 110200110230031 |
11 | 3212767134a898 |
12 | 10439629b42813 |
13 | 4964a973a65b3 |
14 | 1d2d9dc917743 |
15 | cb18576ac906 |
hex | 6439f66caa0f |
110200110230031 has 8 divisors (see below), whose sum is σ = 146953783428144. Its totient is φ = 73456588592640.
The previous prime is 110200110230011. The next prime is 110200110230087. The reversal of 110200110230031 is 130032011002011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110200110230031 - 29 = 110200110229519 is a prime.
It is a super-2 number, since 2×1102001102300312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110200110230011) 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, 2537864850 + ... + 2537908271.
It is an arithmetic number, because the mean of its divisors is an integer number (18369222928518).
Almost surely, 2110200110230031 is an apocalyptic number.
110200110230031 is a deficient number, since it is larger than the sum of its proper divisors (36753673198113).
110200110230031 is an equidigital number, since it uses as much as digits as its factorization.
110200110230031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5075780361.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 110200110230031 its reverse (130032011002011), we get a palindrome (240232121232042).
The spelling of 110200110230031 in words is "one hundred ten trillion, two hundred billion, one hundred ten million, two hundred thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •