Base | Representation |
---|---|
bin | 1001001100011110101110… |
… | …0111101101001111111001 |
3 | 1022210111201001112021120002 |
4 | 2103013223213231033321 |
5 | 2311120300320232301 |
6 | 33300250332442345 |
7 | 2062265333314553 |
oct | 223075347551771 |
9 | 38714631467502 |
10 | 10110011102201 |
11 | 32486a47773aa |
12 | 117347a3193b5 |
13 | 5844a6a4187a |
14 | 26d4819a24d3 |
15 | 127eb7ed016b |
hex | 931eb9ed3f9 |
10110011102201 has 4 divisors (see below), whose sum is σ = 10110246190692. Its totient is φ = 10109776013712.
The previous prime is 10110011102189. The next prime is 10110011102299. The reversal of 10110011102201 is 10220111001101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 9468538255801 + 641472846400 = 3077099^2 + 800920^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10110011102201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10110011102801) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 117479726 + ... + 117565751.
It is an arithmetic number, because the mean of its divisors is an integer number (2527561547673).
Almost surely, 210110011102201 is an apocalyptic number.
It is an amenable number.
10110011102201 is a deficient number, since it is larger than the sum of its proper divisors (235088491).
10110011102201 is an equidigital number, since it uses as much as digits as its factorization.
10110011102201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 235088490.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 10110011102201 its reverse (10220111001101), we get a palindrome (20330122103302).
The spelling of 10110011102201 in words is "ten trillion, one hundred ten billion, eleven million, one hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •