Base | Representation |
---|---|
bin | 10111101001101111010010… |
… | …011110110011011011010111 |
3 | 111122022112102201022002112122 |
4 | 113221233102132303123113 |
5 | 102113304302110412101 |
6 | 1005123355320410155 |
7 | 30624303304640261 |
oct | 2751572236633327 |
9 | 448275381262478 |
10 | 104023344232151 |
11 | 30166063a32993 |
12 | b80050761695b |
13 | 46074894175a6 |
14 | 1b98a84648b31 |
15 | c05d44dd451b |
hex | 5e9bd27b36d7 |
104023344232151 has 2 divisors, whose sum is σ = 104023344232152. Its totient is φ = 104023344232150.
The previous prime is 104023344232123. The next prime is 104023344232153. The reversal of 104023344232151 is 151232443320401.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 104023344232151 - 234 = 104006164362967 is a prime.
It is a super-2 number, since 2×1040233442321512 (a number of 29 digits) contains 22 as substring.
Together with 104023344232153, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104023344232153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52011672116075 + 52011672116076.
It is an arithmetic number, because the mean of its divisors is an integer number (52011672116076).
Almost surely, 2104023344232151 is an apocalyptic number.
104023344232151 is a deficient number, since it is larger than the sum of its proper divisors (1).
104023344232151 is an equidigital number, since it uses as much as digits as its factorization.
104023344232151 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 69120, while the sum is 35.
Adding to 104023344232151 its reverse (151232443320401), we get a palindrome (255255787552552).
The spelling of 104023344232151 in words is "one hundred four trillion, twenty-three billion, three hundred forty-four million, two hundred thirty-two thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •