Base | Representation |
---|---|
bin | 11001000010001100100100… |
… | …101000000000110110110001 |
3 | 112102211122202201210011110102 |
4 | 121002030210220000312301 |
5 | 103412403100340231001 |
6 | 1030100112412442145 |
7 | 32122420463542061 |
oct | 3102144450006661 |
9 | 472748681704412 |
10 | 110102101102001 |
11 | 3209a047797328 |
12 | 10422636a79355 |
13 | 4958778196508 |
14 | 1d28d820573a1 |
15 | cae01d130e6b |
hex | 642324a00db1 |
110102101102001 has 8 divisors (see below), whose sum is σ = 110555592463008. Its totient is φ = 109648727500000.
The previous prime is 110102101101959. The next prime is 110102101102013. The reversal of 110102101102001 is 100201101201011.
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 110102101102001 - 210 = 110102101100977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110102101102801) 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 7 ways as a sum of consecutive naturals, for example, 27565700 + ... + 31306101.
It is an arithmetic number, because the mean of its divisors is an integer number (13819449057876).
Almost surely, 2110102101102001 is an apocalyptic number.
It is an amenable number.
110102101102001 is a deficient number, since it is larger than the sum of its proper divisors (453491361007).
110102101102001 is an equidigital number, since it uses as much as digits as its factorization.
110102101102001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58879503.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 110102101102001 its reverse (100201101201011), we get a palindrome (210303202303012).
The spelling of 110102101102001 in words is "one hundred ten trillion, one hundred two billion, one hundred one million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •