Base | Representation |
---|---|
bin | 10111110000110110111100… |
… | …011111011010011111010101 |
3 | 111201001022021220021210001020 |
4 | 113300312330133122133111 |
5 | 102144313302000041031 |
6 | 1010140232031151353 |
7 | 31004533460440020 |
oct | 2760667437323725 |
9 | 451038256253036 |
10 | 104512601565141 |
11 | 303345aaa44690 |
12 | b87b2aa975559 |
13 | 464165aa4a063 |
14 | 1bb4618c261b7 |
15 | c1392c85a096 |
hex | 5f0dbc7da7d5 |
104512601565141 has 64 divisors (see below), whose sum is σ = 173898465269760. Its totient is φ = 54241269960960.
The previous prime is 104512601565137. The next prime is 104512601565193. The reversal of 104512601565141 is 141565106215401.
It is a happy number.
It is not a de Polignac number, because 104512601565141 - 22 = 104512601565137 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 104512601565093 and 104512601565102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104512601565041) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1400992255 + ... + 1401066851.
It is an arithmetic number, because the mean of its divisors is an integer number (2717163519840).
Almost surely, 2104512601565141 is an apocalyptic number.
104512601565141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
104512601565141 is a deficient number, since it is larger than the sum of its proper divisors (69385863704619).
104512601565141 is a wasteful number, since it uses less digits than its factorization.
104512601565141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 80234.
The product of its (nonzero) digits is 144000, while the sum is 42.
The spelling of 104512601565141 in words is "one hundred four trillion, five hundred twelve billion, six hundred one million, five hundred sixty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •