Base | Representation |
---|---|
bin | 10111101101111111100011… |
… | …010111010011000110111001 |
3 | 111200100111000110111200211001 |
4 | 113231333203113103012321 |
5 | 102133102010411103221 |
6 | 1005505544135205001 |
7 | 30654362632423165 |
oct | 2755774327230671 |
9 | 450314013450731 |
10 | 104315685253561 |
11 | 30269040904211 |
12 | b8490b3b16761 |
13 | 4628c085645b2 |
14 | 1ba8c984d3ca5 |
15 | c0d754eab391 |
hex | 5edfe35d31b9 |
104315685253561 has 4 divisors (see below), whose sum is σ = 104692276175332. Its totient is φ = 103939094331792.
The previous prime is 104315685253529. The next prime is 104315685253597. The reversal of 104315685253561 is 165352586513401.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 51584269763961 + 52731415489600 = 7182219^2 + 7261640^2 .
It is a cyclic number.
It is not a de Polignac number, because 104315685253561 - 25 = 104315685253529 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104315685253501) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 188295460470 + ... + 188295461023.
It is an arithmetic number, because the mean of its divisors is an integer number (26173069043833).
Almost surely, 2104315685253561 is an apocalyptic number.
It is an amenable number.
104315685253561 is a deficient number, since it is larger than the sum of its proper divisors (376590921771).
104315685253561 is an equidigital number, since it uses as much as digits as its factorization.
104315685253561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 376590921770.
The product of its (nonzero) digits is 12960000, while the sum is 55.
The spelling of 104315685253561 in words is "one hundred four trillion, three hundred fifteen billion, six hundred eighty-five million, two hundred fifty-three thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •