Base | Representation |
---|---|
bin | 101111110110000100… |
… | …0010011011001101001 |
3 | 100211012112102211202121 |
4 | 1133230020103121221 |
5 | 3140410414104101 |
6 | 115111212031241 |
7 | 10265065202341 |
oct | 1375410233151 |
9 | 324175384677 |
10 | 102745847401 |
11 | 3a63539697a |
12 | 17ab5462521 |
13 | 98c5659412 |
14 | 4d899c9d21 |
15 | 2a153290a1 |
hex | 17ec213669 |
102745847401 has 4 divisors (see below), whose sum is σ = 108153523600. Its totient is φ = 97338171204.
The previous prime is 102745847389. The next prime is 102745847471. The reversal of 102745847401 is 104748547201.
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, and also an emirpimes, since its reverse is a distinct semiprime: 104748547201 = 29 ⋅3612018869.
It is a cyclic number.
It is not a de Polignac number, because 102745847401 - 217 = 102745716329 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102745847471) 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 3 ways as a sum of consecutive naturals, for example, 2703838071 + ... + 2703838108.
It is an arithmetic number, because the mean of its divisors is an integer number (27038380900).
Almost surely, 2102745847401 is an apocalyptic number.
It is an amenable number.
102745847401 is a deficient number, since it is larger than the sum of its proper divisors (5407676199).
102745847401 is an equidigital number, since it uses as much as digits as its factorization.
102745847401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5407676198.
The product of its (nonzero) digits is 250880, while the sum is 43.
The spelling of 102745847401 in words is "one hundred two billion, seven hundred forty-five million, eight hundred forty-seven thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •