Base | Representation |
---|---|
bin | 110011010100110101… |
… | …1110010110000101010 |
3 | 101112111111021112212002 |
4 | 1212221223302300222 |
5 | 3301213034341020 |
6 | 122345042451002 |
7 | 10651244100224 |
oct | 1465153626052 |
9 | 345444245762 |
10 | 110221012010 |
11 | 4282098476a |
12 | 19440963a62 |
13 | a517230145 |
14 | 54986b5414 |
15 | 2d01702975 |
hex | 19a9af2c2a |
110221012010 has 8 divisors (see below), whose sum is σ = 198397821636. Its totient is φ = 44088404800.
The previous prime is 110221012003. The next prime is 110221012079. The reversal of 110221012010 is 10210122011.
It can be written as a sum of positive squares in 2 ways, for example, as 101857360801 + 8363651209 = 319151^2 + 91453^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 110221011982 and 110221012000.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5511050591 + ... + 5511050610.
Almost surely, 2110221012010 is an apocalyptic number.
110221012010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110221012010 is a deficient number, since it is larger than the sum of its proper divisors (88176809626).
110221012010 is a wasteful number, since it uses less digits than its factorization.
110221012010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11022101208.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 110221012010 its reverse (10210122011), we get a palindrome (120431134021).
The spelling of 110221012010 in words is "one hundred ten billion, two hundred twenty-one million, twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •