Base | Representation |
---|---|
bin | 101111101011001000… |
… | …0011100000001000001 |
3 | 100210020221221000121201 |
4 | 1133112100130001001 |
5 | 3134132443143324 |
6 | 115010542421201 |
7 | 10253021062612 |
oct | 1372620340101 |
9 | 323227830551 |
10 | 102378881089 |
11 | 3a467233731 |
12 | 17a12591801 |
13 | 98676128a4 |
14 | 4d52d83c09 |
15 | 29e2edd444 |
hex | 17d641c041 |
102378881089 has 3 divisors (see below), whose sum is σ = 102379201057. Its totient is φ = 102378561122.
The previous prime is 102378881083. The next prime is 102378881117. The reversal of 102378881089 is 980188873201.
The square root of 102378881089 is 319967.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 980188873201 = 173 ⋅5665831637.
It is not a de Polignac number, because 102378881089 - 211 = 102378879041 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102378881083) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 159984 + ... + 479950.
Almost surely, 2102378881089 is an apocalyptic number.
102378881089 is the 319967-th square number.
102378881089 is the 159984-th centered octagonal number.
It is an amenable number.
102378881089 is a deficient number, since it is larger than the sum of its proper divisors (319968).
102378881089 is an frugal number, since it uses more digits than its factorization.
102378881089 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 639934 (or 319967 counting only the distinct ones).
The product of its (nonzero) digits is 1548288, while the sum is 55.
The spelling of 102378881089 in words is "one hundred two billion, three hundred seventy-eight million, eight hundred eighty-one thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •