Base | Representation |
---|---|
bin | 110000011100000110… |
… | …1011010001001001101 |
3 | 100221111111020000122220 |
4 | 1200320031122021031 |
5 | 3201014144113112 |
6 | 115442005525553 |
7 | 10341524400003 |
oct | 1407015321115 |
9 | 327444200586 |
10 | 104022254157 |
11 | 4012a93a198 |
12 | 181b0a138b9 |
13 | 9a69c235a3 |
14 | 506b328a73 |
15 | 2a8c40898c |
hex | 183835a24d |
104022254157 has 4 divisors (see below), whose sum is σ = 138696338880. Its totient is φ = 69348169436.
The previous prime is 104022254143. The next prime is 104022254201. The reversal of 104022254157 is 751452220401.
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, and also an emirpimes, since its reverse is a distinct semiprime: 751452220401 = 3 ⋅250484073467.
It is a cyclic number.
It is not a de Polignac number, because 104022254157 - 28 = 104022253901 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104022252157) 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, 17337042357 + ... + 17337042362.
It is an arithmetic number, because the mean of its divisors is an integer number (34674084720).
Almost surely, 2104022254157 is an apocalyptic number.
It is an amenable number.
104022254157 is a deficient number, since it is larger than the sum of its proper divisors (34674084723).
104022254157 is an equidigital number, since it uses as much as digits as its factorization.
104022254157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34674084722.
The product of its (nonzero) digits is 22400, while the sum is 33.
Adding to 104022254157 its reverse (751452220401), we get a palindrome (855474474558).
The spelling of 104022254157 in words is "one hundred four billion, twenty-two million, two hundred fifty-four thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •