Base | Representation |
---|---|
bin | 10111101001011100000000… |
… | …101011101100010000110011 |
3 | 111122020120000010011002002010 |
4 | 113221130000223230100303 |
5 | 102112434403444314011 |
6 | 1005110053314054003 |
7 | 30622641325225161 |
oct | 2751340053542063 |
9 | 448216003132063 |
10 | 104002644526131 |
11 | 3015830154542a |
12 | b7b84ab27a303 |
13 | 460553aaa4330 |
14 | 1b97a7d464231 |
15 | c05532a031a6 |
hex | 5e9700aec433 |
104002644526131 has 64 divisors (see below), whose sum is σ = 154671132954240. Its totient is φ = 61752568872960.
The previous prime is 104002644526061. The next prime is 104002644526133. The reversal of 104002644526131 is 131625446200401.
It is not a de Polignac number, because 104002644526131 - 222 = 104002640331827 is a prime.
It is a super-2 number, since 2×1040026445261312 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a self number, because there is not a number n which added to its sum of digits gives 104002644526131.
It is not an unprimeable number, because it can be changed into a prime (104002644526133) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 81944205 + ... + 83203713.
It is an arithmetic number, because the mean of its divisors is an integer number (2416736452410).
Almost surely, 2104002644526131 is an apocalyptic number.
104002644526131 is a deficient number, since it is larger than the sum of its proper divisors (50668488428109).
104002644526131 is a wasteful number, since it uses less digits than its factorization.
104002644526131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1260136.
The product of its (nonzero) digits is 138240, while the sum is 39.
The spelling of 104002644526131 in words is "one hundred four trillion, two billion, six hundred forty-four million, five hundred twenty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •