Base | Representation |
---|---|
bin | 10111011100011100110001… |
… | …000000001100110001111001 |
3 | 111112002020012021221110220010 |
4 | 113130130301000030301321 |
5 | 102003323442103323001 |
6 | 1003144043230252133 |
7 | 30501313310066061 |
oct | 2734346100146171 |
9 | 445066167843803 |
10 | 103110102011001 |
11 | 2a943826568378 |
12 | b693518657049 |
13 | 456c31933b987 |
14 | 1b667ac6843a1 |
15 | bdc1e505b8d6 |
hex | 5dc73100cc79 |
103110102011001 has 4 divisors (see below), whose sum is σ = 137480136014672. Its totient is φ = 68740068007332.
The previous prime is 103110102010991. The next prime is 103110102011023. The reversal of 103110102011001 is 100110201011301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 103110102011001 - 25 = 103110102010969 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (103110102011041) 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, 17185017001831 + ... + 17185017001836.
It is an arithmetic number, because the mean of its divisors is an integer number (34370034003668).
Almost surely, 2103110102011001 is an apocalyptic number.
It is an amenable number.
103110102011001 is a deficient number, since it is larger than the sum of its proper divisors (34370034003671).
103110102011001 is an equidigital number, since it uses as much as digits as its factorization.
103110102011001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34370034003670.
The product of its (nonzero) digits is 6, while the sum is 12.
Adding to 103110102011001 its reverse (100110201011301), we get a palindrome (203220303022302).
The spelling of 103110102011001 in words is "one hundred three trillion, one hundred ten billion, one hundred two million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •