Base | Representation |
---|---|
bin | 10111101001100110001101… |
… | …111011001111111111011001 |
3 | 111122021121021220120110200121 |
4 | 113221212031323033333121 |
5 | 102113124330124023211 |
6 | 1005115105020233241 |
7 | 30623510034260314 |
oct | 2751461573177731 |
9 | 448247256513617 |
10 | 104013604126681 |
11 | 30161a1599a547 |
12 | b7ba64969b821 |
13 | 4606596525382 |
14 | 1b983dcc1997b |
15 | c05974c62271 |
hex | 5e998decffd9 |
104013604126681 has 16 divisors (see below), whose sum is σ = 105156405544960. Its totient is φ = 102875904109440.
The previous prime is 104013604126609. The next prime is 104013604126717. The reversal of 104013604126681 is 186621406310401.
It is a cyclic number.
It is not a de Polignac number, because 104013604126681 - 233 = 104005014192089 is a prime.
It is a super-2 number, since 2×1040136041266812 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104013604126181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 692568565 + ... + 692718733.
It is an arithmetic number, because the mean of its divisors is an integer number (6572275346560).
Almost surely, 2104013604126681 is an apocalyptic number.
It is an amenable number.
104013604126681 is a deficient number, since it is larger than the sum of its proper divisors (1142801418279).
104013604126681 is a wasteful number, since it uses less digits than its factorization.
104013604126681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167104.
The product of its (nonzero) digits is 165888, while the sum is 43.
The spelling of 104013604126681 in words is "one hundred four trillion, thirteen billion, six hundred four million, one hundred twenty-six thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •