Base | Representation |
---|---|
bin | 11001000010010100000001… |
… | …111111100100101010010010 |
3 | 112102212102102212221211211200 |
4 | 121002110001333210222102 |
5 | 103413021001130310002 |
6 | 1030103515231252030 |
7 | 32123123113253064 |
oct | 3102240177445222 |
9 | 472772385854750 |
10 | 110110110010002 |
11 | 320a2487599463 |
12 | 104240b107a016 |
13 | 495945350812b |
14 | 1d2950199d734 |
15 | cae33b2dab1c |
hex | 642501fe4a92 |
110110110010002 has 48 divisors (see below), whose sum is σ = 252633138981912. Its totient is φ = 34540574906880.
The previous prime is 110110110009961. The next prime is 110110110010009. The reversal of 110110110010002 is 200010011011011.
It can be written as a sum of positive squares in 4 ways, for example, as 66310875636201 + 43799234373801 = 8143149^2 + 6618099^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (110110110010009) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 16846149 + ... + 22450232.
Almost surely, 2110110110010002 is an apocalyptic number.
110110110010002 is an abundant number, since it is smaller than the sum of its proper divisors (142523028971910).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110110110010002 is a wasteful number, since it uses less digits than its factorization.
110110110010002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39305563 (or 39305560 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 110110110010002 its reverse (200010011011011), we get a palindrome (310120121021013).
The spelling of 110110110010002 in words is "one hundred ten trillion, one hundred ten billion, one hundred ten million, ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •