Base | Representation |
---|---|
bin | 10111101001011001100011… |
… | …000111111110100110001011 |
3 | 111122020022011220011012112222 |
4 | 113221121203013332212023 |
5 | 102112414000243004011 |
6 | 1005104535125124255 |
7 | 30622515656640314 |
oct | 2751314307764613 |
9 | 448208156135488 |
10 | 104000001141131 |
11 | 30157175408127 |
12 | b7b7a91b5968b |
13 | 4605209250bb4 |
14 | 1b978ac36b60b |
15 | c0542a902ddb |
hex | 5e96631fe98b |
104000001141131 has 8 divisors (see below), whose sum is σ = 104100089587200. Its totient is φ = 103899929593600.
The previous prime is 104000001141119. The next prime is 104000001141149. The reversal of 104000001141131 is 131141100000401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 104000001141131 - 218 = 104000000878987 is a prime.
It is a super-2 number, since 2×1040000011411312 (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 (104000001141931) 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, 8107355 + ... + 16544763.
It is an arithmetic number, because the mean of its divisors is an integer number (13012511198400).
Almost surely, 2104000001141131 is an apocalyptic number.
104000001141131 is a deficient number, since it is larger than the sum of its proper divisors (100088446069).
104000001141131 is a wasteful number, since it uses less digits than its factorization.
104000001141131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8449269.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 104000001141131 its reverse (131141100000401), we get a palindrome (235141101141532).
The spelling of 104000001141131 in words is "one hundred four trillion, one million, one hundred forty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •