Base | Representation |
---|---|
bin | 10111101001011011011011… |
… | …101001100110001101001001 |
3 | 111122020111101211001110100110 |
4 | 113221123123221212031021 |
5 | 102112432120421020131 |
6 | 1005105511521224533 |
7 | 30622620042220152 |
oct | 2751333351461511 |
9 | 448214354043313 |
10 | 104002023220041 |
11 | 30158012864a21 |
12 | b7b8357192149 |
13 | 460546c1589ab |
14 | 1b97a20b32929 |
15 | c054e81c7646 |
hex | 5e96dba66349 |
104002023220041 has 4 divisors (see below), whose sum is σ = 138669364293392. Its totient is φ = 69334682146692.
The previous prime is 104002023220001. The next prime is 104002023220061. The reversal of 104002023220041 is 140022320200401.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 104002023220041 - 26 = 104002023219977 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (104002023220001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17333670536671 + ... + 17333670536676.
It is an arithmetic number, because the mean of its divisors is an integer number (34667341073348).
Almost surely, 2104002023220041 is an apocalyptic number.
It is an amenable number.
104002023220041 is a deficient number, since it is larger than the sum of its proper divisors (34667341073351).
104002023220041 is an equidigital number, since it uses as much as digits as its factorization.
104002023220041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34667341073350.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 104002023220041 its reverse (140022320200401), we get a palindrome (244024343420442).
The spelling of 104002023220041 in words is "one hundred four trillion, two billion, twenty-three million, two hundred twenty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •