Base | Representation |
---|---|
bin | 10111101001101111010010… |
… | …011110110011101001101111 |
3 | 111122022112102201022010210201 |
4 | 113221233102132303221233 |
5 | 102113304302110424241 |
6 | 1005123355320414331 |
7 | 30624303304643044 |
oct | 2751572236635157 |
9 | 448275381263721 |
10 | 104023344233071 |
11 | 30166063a3364a |
12 | b8005076173a7 |
13 | 4607489417b33 |
14 | 1b98a846491cb |
15 | c05d44dd4931 |
hex | 5e9bd27b3a6f |
104023344233071 has 2 divisors, whose sum is σ = 104023344233072. Its totient is φ = 104023344233070.
The previous prime is 104023344233059. The next prime is 104023344233077. The reversal of 104023344233071 is 170332443320401.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-104023344233071 is a prime.
It is a super-2 number, since 2×1040233442330712 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 104023344233071.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104023344233077) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52011672116535 + 52011672116536.
It is an arithmetic number, because the mean of its divisors is an integer number (52011672116536).
Almost surely, 2104023344233071 is an apocalyptic number.
104023344233071 is a deficient number, since it is larger than the sum of its proper divisors (1).
104023344233071 is an equidigital number, since it uses as much as digits as its factorization.
104023344233071 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 145152, while the sum is 37.
Adding to 104023344233071 its reverse (170332443320401), we get a palindrome (274355787553472).
The spelling of 104023344233071 in words is "one hundred four trillion, twenty-three billion, three hundred forty-four million, two hundred thirty-three thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •