Base | Representation |
---|---|
bin | 110011001111001001… |
… | …1111010010010011010 |
3 | 101112000012020101202001 |
4 | 1212132103322102122 |
5 | 3300320212431020 |
6 | 122314105031214 |
7 | 10643436166651 |
oct | 1463623722232 |
9 | 345005211661 |
10 | 110030202010 |
11 | 427331a9353 |
12 | 193a8a8550a |
13 | a4b6842b11 |
14 | 547b206198 |
15 | 2cdeab150a |
hex | 199e4fa49a |
110030202010 has 8 divisors (see below), whose sum is σ = 198054363636. Its totient is φ = 44012080800.
The previous prime is 110030201999. The next prime is 110030202077. The reversal of 110030202010 is 10202030011.
It can be written as a sum of positive squares in 2 ways, for example, as 108107467209 + 1922734801 = 328797^2 + 43849^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1100302020102 (a number of 23 digits) contains 22 as substring.
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: 11003020201 = 110030202010 / (1 + 1 + 0 + 0 + 3 + 0 + 2 + 0 + 2 + 0 + 1 + 0).
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, 5501510091 + ... + 5501510110.
Almost surely, 2110030202010 is an apocalyptic number.
110030202010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110030202010 is a deficient number, since it is larger than the sum of its proper divisors (88024161626).
110030202010 is a wasteful number, since it uses less digits than its factorization.
110030202010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11003020208.
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 110030202010 its reverse (10202030011), we get a palindrome (120232232021).
The spelling of 110030202010 in words is "one hundred ten billion, thirty million, two hundred two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •