Base | Representation |
---|---|
bin | 101111011111111001… |
… | …1110100101100110111 |
3 | 100202021201021202210022 |
4 | 1132333303310230313 |
5 | 3132400041000041 |
6 | 114505330515355 |
7 | 10240466041142 |
oct | 1367763645467 |
9 | 322251252708 |
10 | 102002281271 |
11 | 3a2936a0710 |
12 | 17928435b5b |
13 | 98075a5267 |
14 | 4d18d51059 |
15 | 29beded24b |
hex | 17bfcf4b37 |
102002281271 has 8 divisors (see below), whose sum is σ = 111307670544. Its totient is φ = 92702301120.
The previous prime is 102002281237. The next prime is 102002281273. The reversal of 102002281271 is 172182200201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102002281271 - 214 = 102002264887 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102002281271.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102002281273) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1312796 + ... + 1388321.
It is an arithmetic number, because the mean of its divisors is an integer number (13913458818).
Almost surely, 2102002281271 is an apocalyptic number.
102002281271 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
102002281271 is a deficient number, since it is larger than the sum of its proper divisors (9305389273).
102002281271 is a wasteful number, since it uses less digits than its factorization.
102002281271 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2704561.
The product of its (nonzero) digits is 896, while the sum is 26.
Adding to 102002281271 its reverse (172182200201), we get a palindrome (274184481472).
The spelling of 102002281271 in words is "one hundred two billion, two million, two hundred eighty-one thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.251 sec. • engine limits •