Base | Representation |
---|---|
bin | 10111110110001110100001… |
… | …001100001000100000000111 |
3 | 111202100120111210221020022210 |
4 | 113312032201030020200013 |
5 | 102221334313220311401 |
6 | 1011021522330354503 |
7 | 31043303415450201 |
oct | 2766164114104007 |
9 | 452316453836283 |
10 | 104881510713351 |
11 | 30466aa95a6949 |
12 | b91a8a588ba33 |
13 | 466a38ccc6578 |
14 | 1bc8413b43771 |
15 | c1d31e99e4d6 |
hex | 5f63a1308807 |
104881510713351 has 24 divisors (see below), whose sum is σ = 149367681106560. Its totient is φ = 65442870293904.
The previous prime is 104881510713251. The next prime is 104881510713391. The reversal of 104881510713351 is 153317015188401.
It is not a de Polignac number, because 104881510713351 - 27 = 104881510713223 is a prime.
It is a super-2 number, since 2×1048815107133512 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 104881510713351.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104881510713391) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 583304691 + ... + 583484468.
It is an arithmetic number, because the mean of its divisors is an integer number (6223653379440).
Almost surely, 2104881510713351 is an apocalyptic number.
104881510713351 is a deficient number, since it is larger than the sum of its proper divisors (44486170393209).
104881510713351 is a wasteful number, since it uses less digits than its factorization.
104881510713351 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1166789283 (or 1166789264 counting only the distinct ones).
The product of its (nonzero) digits is 403200, while the sum is 48.
The spelling of 104881510713351 in words is "one hundred four trillion, eight hundred eighty-one billion, five hundred ten million, seven hundred thirteen thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •