Base | Representation |
---|---|
bin | 10111101101111111100011… |
… | …010111010011000110110111 |
3 | 111200100111000110111200210222 |
4 | 113231333203113103012313 |
5 | 102133102010411103214 |
6 | 1005505544135204555 |
7 | 30654362632423163 |
oct | 2755774327230667 |
9 | 450314013450728 |
10 | 104315685253559 |
11 | 3026904090420a |
12 | b8490b3b1675b |
13 | 4628c085645b0 |
14 | 1ba8c984d3ca3 |
15 | c0d754eab38e |
hex | 5edfe35d31b7 |
104315685253559 has 16 divisors (see below), whose sum is σ = 113279281920000. Its totient is φ = 95487881641056.
The previous prime is 104315685253529. The next prime is 104315685253597. The reversal of 104315685253559 is 955352586513401.
It is a cyclic number.
It is not a de Polignac number, because 104315685253559 - 212 = 104315685249463 is a prime.
It is a super-2 number, since 2×1043156852535592 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104315685253519) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 31887059 + ... + 35005940.
It is an arithmetic number, because the mean of its divisors is an integer number (7079955120000).
Almost surely, 2104315685253559 is an apocalyptic number.
104315685253559 is a deficient number, since it is larger than the sum of its proper divisors (8963596666441).
104315685253559 is a wasteful number, since it uses less digits than its factorization.
104315685253559 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66894014.
The product of its (nonzero) digits is 97200000, while the sum is 62.
The spelling of 104315685253559 in words is "one hundred four trillion, three hundred fifteen billion, six hundred eighty-five million, two hundred fifty-three thousand, five hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •