Base | Representation |
---|---|
bin | 11001000010001100101011… |
… | …110001110110100111010010 |
3 | 112102211200002002121210221122 |
4 | 121002030223301312213102 |
5 | 103412403322101401002 |
6 | 1030100132341122242 |
7 | 32122423451645444 |
oct | 3102145361664722 |
9 | 472750062553848 |
10 | 110102221122002 |
11 | 3209a0a951210a |
12 | 1042266b0b9382 |
13 | 4958796cc9575 |
14 | 1d28d93d7a494 |
15 | cae02893c6a2 |
hex | 64232bc769d2 |
110102221122002 has 8 divisors (see below), whose sum is σ = 165287711940300. Its totient is φ = 55006317141904.
The previous prime is 110102221121987. The next prime is 110102221122067. The reversal of 110102221122002 is 200221122201011.
It can be written as a sum of positive squares in 2 ways, for example, as 101945148110521 + 8157073011481 = 10096789^2 + 2856059^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22396706477 + ... + 22396711392.
Almost surely, 2110102221122002 is an apocalyptic number.
110102221122002 is a deficient number, since it is larger than the sum of its proper divisors (55185490818298).
110102221122002 is a wasteful number, since it uses less digits than its factorization.
110102221122002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44793419100.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 110102221122002 its reverse (200221122201011), we get a palindrome (310323343323013).
The spelling of 110102221122002 in words is "one hundred ten trillion, one hundred two billion, two hundred twenty-one million, one hundred twenty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •