Base | Representation |
---|---|
bin | 10111010100011000001100… |
… | …110101000010001100100001 |
3 | 111110010012112020122112101122 |
4 | 113110120030311002030201 |
5 | 101420232022221314410 |
6 | 1002041153135142025 |
7 | 30413246341403564 |
oct | 2724301465021441 |
9 | 443105466575348 |
10 | 102555444323105 |
11 | 2a74a579783a94 |
12 | b603b22974915 |
13 | 452bc244b6457 |
14 | 1b479d22d84db |
15 | bcca80be7e55 |
hex | 5d460cd42321 |
102555444323105 has 8 divisors (see below), whose sum is σ = 127036421355264. Its totient is φ = 79397763346800.
The previous prime is 102555444323081. The next prime is 102555444323149. The reversal of 102555444323105 is 501323444555201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102555444323105 - 210 = 102555444322081 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 330824013791 + ... + 330824014100.
It is an arithmetic number, because the mean of its divisors is an integer number (15879552669408).
Almost surely, 2102555444323105 is an apocalyptic number.
It is an amenable number.
102555444323105 is a deficient number, since it is larger than the sum of its proper divisors (24480977032159).
102555444323105 is an equidigital number, since it uses as much as digits as its factorization.
102555444323105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 661648027927.
The product of its (nonzero) digits is 1440000, while the sum is 44.
Adding to 102555444323105 its reverse (501323444555201), we get a palindrome (603878888878306).
The spelling of 102555444323105 in words is "one hundred two trillion, five hundred fifty-five billion, four hundred forty-four million, three hundred twenty-three thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •