Base | Representation |
---|---|
bin | 11001000000110110110011… |
… | …100100110001000000000001 |
3 | 112102111212001202100011022000 |
4 | 121000312303210301000001 |
5 | 103404401000042041001 |
6 | 1025545522335134213 |
7 | 32112650414205546 |
oct | 3100666344610001 |
9 | 472455052304260 |
10 | 110010010112001 |
11 | 32063a8a83152a |
12 | 10408815974369 |
13 | 494cb900bc45c |
14 | 1d24727576bcd |
15 | cab92d41ba86 |
hex | 640db3931001 |
110010010112001 has 32 divisors (see below), whose sum is σ = 164274391756800. Its totient is φ = 72756630777600.
The previous prime is 110010010111973. The next prime is 110010010112027. The reversal of 110010010112001 is 100211010010011.
It is not a de Polignac number, because 110010010112001 - 27 = 110010010111873 is a prime.
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 (110010010112071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 41229495 + ... + 43816563.
It is an arithmetic number, because the mean of its divisors is an integer number (5133574742400).
Almost surely, 2110010010112001 is an apocalyptic number.
It is an amenable number.
110010010112001 is a deficient number, since it is larger than the sum of its proper divisors (54264381644799).
110010010112001 is a wasteful number, since it uses less digits than its factorization.
110010010112001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2599606 (or 2599600 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 110010010112001 its reverse (100211010010011), we get a palindrome (210221020122012).
The spelling of 110010010112001 in words is "one hundred ten trillion, ten billion, ten million, one hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •