Base | Representation |
---|---|
bin | 110001000101111011… |
… | …1000010000010000000 |
3 | 101002010022000011021020 |
4 | 1202023313002002000 |
5 | 3211402433034433 |
6 | 120233142025440 |
7 | 10421355306060 |
oct | 1421367020200 |
9 | 332108004236 |
10 | 105425674368 |
11 | 40790054603 |
12 | 18522a18280 |
13 | 9c318cba51 |
14 | 516188b3a0 |
15 | 2b20726cb3 |
hex | 188bdc2080 |
105425674368 has 64 divisors (see below), whose sum is σ = 320042233920. Its totient is φ = 30121620480.
The previous prime is 105425674327. The next prime is 105425674391. The reversal of 105425674368 is 863476524501.
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-2 number, since 2×1054256743682 (a number of 23 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 105425674368.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19607743 + ... + 19613118.
It is an arithmetic number, because the mean of its divisors is an integer number (5000659905).
Almost surely, 2105425674368 is an apocalyptic number.
It is an amenable number.
105425674368 is an abundant number, since it is smaller than the sum of its proper divisors (214616559552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105425674368 is an equidigital number, since it uses as much as digits as its factorization.
105425674368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39220885 (or 39220873 counting only the distinct ones).
The product of its (nonzero) digits is 4838400, while the sum is 51.
The spelling of 105425674368 in words is "one hundred five billion, four hundred twenty-five million, six hundred seventy-four thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •