Base | Representation |
---|---|
bin | 101111100101110101… |
… | …0110010111000001111 |
3 | 100202210120122222100222 |
4 | 1133023222302320033 |
5 | 3133302004203403 |
6 | 114541155141555 |
7 | 10245433134023 |
oct | 1371352627017 |
9 | 322716588328 |
10 | 102201241103 |
11 | 3a385a33125 |
12 | 17982ba48bb |
13 | 9839886c80 |
14 | 4d37542383 |
15 | 29d25ee338 |
hex | 17cbab2e0f |
102201241103 has 4 divisors (see below), whose sum is σ = 110062875048. Its totient is φ = 94339607160.
The previous prime is 102201241063. The next prime is 102201241139. The reversal of 102201241103 is 301142102201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 301142102201 = 78779 ⋅3822619.
It is a cyclic number.
It is not a de Polignac number, because 102201241103 - 218 = 102200978959 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102201241183) 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, 3930816953 + ... + 3930816978.
It is an arithmetic number, because the mean of its divisors is an integer number (27515718762).
Almost surely, 2102201241103 is an apocalyptic number.
102201241103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
102201241103 is a deficient number, since it is larger than the sum of its proper divisors (7861633945).
102201241103 is an equidigital number, since it uses as much as digits as its factorization.
102201241103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7861633944.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 102201241103 its reverse (301142102201), we get a palindrome (403343343304).
The spelling of 102201241103 in words is "one hundred two billion, two hundred one million, two hundred forty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •