Base | Representation |
---|---|
bin | 11001000001000001111110… |
… | …110100101101101001011010 |
3 | 112102120000001001020201202201 |
4 | 121001001332310231221122 |
5 | 103410100034030031020 |
6 | 1025555225202320414 |
7 | 32113553654453611 |
oct | 3101017664555132 |
9 | 472500031221681 |
10 | 110022010002010 |
11 | 320690884184a7 |
12 | 1040b00465910a |
13 | 4951053215ba2 |
14 | 1d25145166878 |
15 | cabdd1b69a0a |
hex | 64107ed2da5a |
110022010002010 has 96 divisors (see below), whose sum is σ = 206233527064320. Its totient is φ = 42240858526464.
The previous prime is 110022010001983. The next prime is 110022010002043. The reversal of 110022010002010 is 10200010220011.
It is a super-3 number, since 3×1100220100020103 (a number of 43 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
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 47 ways as a sum of consecutive naturals, for example, 3154012029 + ... + 3154046911.
It is an arithmetic number, because the mean of its divisors is an integer number (2148265906920).
Almost surely, 2110022010002010 is an apocalyptic number.
110022010002010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110022010002010 is a deficient number, since it is larger than the sum of its proper divisors (96211517062310).
110022010002010 is a wasteful number, since it uses less digits than its factorization.
110022010002010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37432 (or 37379 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 110022010002010 its reverse (10200010220011), we get a palindrome (120222020222021).
The spelling of 110022010002010 in words is "one hundred ten trillion, twenty-two billion, ten million, two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •