Base | Representation |
---|---|
bin | 10111101110100000111011… |
… | …100111001101000111011110 |
3 | 111200110220112020100201221220 |
4 | 113232200323213031013132 |
5 | 102134143411020303302 |
6 | 1005534232401234210 |
7 | 30660102040112664 |
oct | 2756407347150736 |
9 | 450426466321856 |
10 | 104351525556702 |
11 | 30282262813456 |
12 | b854036932966 |
13 | 462c3ca8ac968 |
14 | 1baa8d845ac34 |
15 | c0e6516c54bc |
hex | 5ee83b9cd1de |
104351525556702 has 16 divisors (see below), whose sum is σ = 208703177631360. Its totient is φ = 34783820765912.
The previous prime is 104351525556697. The next prime is 104351525556703. The reversal of 104351525556702 is 207655525153401.
104351525556702 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1043515255567022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104351525556703) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8034199 + ... + 16530317.
It is an arithmetic number, because the mean of its divisors is an integer number (13043948601960).
Almost surely, 2104351525556702 is an apocalyptic number.
104351525556702 is an abundant number, since it is smaller than the sum of its proper divisors (104351652074658).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104351525556702 is a wasteful number, since it uses less digits than its factorization.
104351525556702 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10543167.
The product of its (nonzero) digits is 6300000, while the sum is 51.
The spelling of 104351525556702 in words is "one hundred four trillion, three hundred fifty-one billion, five hundred twenty-five million, five hundred fifty-six thousand, seven hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •