Base | Representation |
---|---|
bin | 101111100000001010… |
… | …1111000100101111110 |
3 | 100202022100002101212001 |
4 | 1133000111320211332 |
5 | 3132404332210420 |
6 | 114510250132514 |
7 | 10240634656555 |
oct | 1370025704576 |
9 | 322270071761 |
10 | 102011210110 |
11 | 3a29873a017 |
12 | 1792b42113a |
13 | 98093b03b4 |
14 | 4d1a1d6d9c |
15 | 29c0ab3b0a |
hex | 17c057897e |
102011210110 has 8 divisors (see below), whose sum is σ = 183620178216. Its totient is φ = 40804484040.
The previous prime is 102011210053. The next prime is 102011210141. The reversal of 102011210110 is 11012110201.
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: 10201121011 = 102011210110 / (1 + 0 + 2 + 0 + 1 + 1 + 2 + 1 + 0 + 1 + 1 + 0).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5100560496 + ... + 5100560515.
It is an arithmetic number, because the mean of its divisors is an integer number (22952522277).
Almost surely, 2102011210110 is an apocalyptic number.
102011210110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102011210110 is a deficient number, since it is larger than the sum of its proper divisors (81608968106).
102011210110 is a wasteful number, since it uses less digits than its factorization.
102011210110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10201121018.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 102011210110 its reverse (11012110201), we get a palindrome (113023320311).
Subtracting from 102011210110 its reverse (11012110201), we obtain a palindrome (90999099909).
The spelling of 102011210110 in words is "one hundred two billion, eleven million, two hundred ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •