Base | Representation |
---|---|
bin | 101111101011001011… |
… | …0110100001010001001 |
3 | 100210021002001221211110 |
4 | 1133112112310022021 |
5 | 3134133410142331 |
6 | 115011042320533 |
7 | 10253041224540 |
oct | 1372626641211 |
9 | 323232057743 |
10 | 102380552841 |
11 | 3a468175746 |
12 | 17a13059149 |
13 | 9867a797a8 |
14 | 4d5329b157 |
15 | 29e321d946 |
hex | 17d65b4289 |
102380552841 has 16 divisors (see below), whose sum is σ = 156024525824. Its totient is φ = 58497148944.
The previous prime is 102380552821. The next prime is 102380552861. The reversal of 102380552841 is 148255083201.
It is an interprime number because it is at equal distance from previous prime (102380552821) and next prime (102380552861).
It is not a de Polignac number, because 102380552841 - 27 = 102380552713 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 102380552841.
It is not an unprimeable number, because it can be changed into a prime (102380552821) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 38005 + ... + 454098.
It is an arithmetic number, because the mean of its divisors is an integer number (9751532864).
Almost surely, 2102380552841 is an apocalyptic number.
It is an amenable number.
102380552841 is a deficient number, since it is larger than the sum of its proper divisors (53643972983).
102380552841 is an equidigital number, since it uses as much as digits as its factorization.
102380552841 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 502020.
The product of its (nonzero) digits is 76800, while the sum is 39.
The spelling of 102380552841 in words is "one hundred two billion, three hundred eighty million, five hundred fifty-two thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •