Base | Representation |
---|---|
bin | 11001000010001011101000… |
… | …111101001100100011110001 |
3 | 112102211120011222002000212101 |
4 | 121002023220331030203301 |
5 | 103412344023101201001 |
6 | 1030055425212100401 |
7 | 32122353616522354 |
oct | 3102135075144361 |
9 | 472746158060771 |
10 | 110101100022001 |
11 | 320996836a6090 |
12 | 104223b7764701 |
13 | 495864896b89a |
14 | 1d28cc910829b |
15 | cadeb02d9a01 |
hex | 6422e8f4c8f1 |
110101100022001 has 8 divisors (see below), whose sum is σ = 120112990756704. Its totient is φ = 100089659257920.
The previous prime is 110101100021971. The next prime is 110101100022007. The reversal of 110101100022001 is 100220001101011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110101100022001 - 29 = 110101100021489 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110101100022007) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 111980935 + ... + 112959868.
It is an arithmetic number, because the mean of its divisors is an integer number (15014123844588).
Almost surely, 2110101100022001 is an apocalyptic number.
110101100022001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110101100022001 is a deficient number, since it is larger than the sum of its proper divisors (10011890734703).
110101100022001 is a wasteful number, since it uses less digits than its factorization.
110101100022001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 224985311.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 110101100022001 its reverse (100220001101011), we get a palindrome (210321101123012).
The spelling of 110101100022001 in words is "one hundred ten trillion, one hundred one billion, one hundred million, twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •