Base | Representation |
---|---|
bin | 10111110010111000101010… |
… | …000001000011010110001101 |
3 | 111201112121210022120110002010 |
4 | 113302320222001003112031 |
5 | 102204104021240201021 |
6 | 1010324224205451433 |
7 | 31020564045161160 |
oct | 2762705201032615 |
9 | 451477708513063 |
10 | 104651878053261 |
11 | 3038868098a620 |
12 | b8a229a270b79 |
13 | 4651825759bc6 |
14 | 1bbb26c319ad7 |
15 | c1737ecb2976 |
hex | 5f2e2a04358d |
104651878053261 has 32 divisors (see below), whose sum is σ = 173982607948800. Its totient is φ = 54359658967680.
The previous prime is 104651878053253. The next prime is 104651878053263. The reversal of 104651878053261 is 162350878156401.
It is a happy number.
It is not a de Polignac number, because 104651878053261 - 23 = 104651878053253 is a prime.
It is a super-2 number, since 2×1046518780532612 (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 (104651878053263) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 18095896 + ... + 23168193.
It is an arithmetic number, because the mean of its divisors is an integer number (5436956498400).
Almost surely, 2104651878053261 is an apocalyptic number.
104651878053261 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
104651878053261 is a deficient number, since it is larger than the sum of its proper divisors (69330729895539).
104651878053261 is a wasteful number, since it uses less digits than its factorization.
104651878053261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41275089.
The product of its (nonzero) digits is 9676800, while the sum is 57.
The spelling of 104651878053261 in words is "one hundred four trillion, six hundred fifty-one billion, eight hundred seventy-eight million, fifty-three thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •