Base | Representation |
---|---|
bin | 110000011100111011… |
… | …1010011101110101111 |
3 | 100221120102110102120212 |
4 | 1200321313103232233 |
5 | 3201043300441101 |
6 | 115444440533035 |
7 | 10342312351565 |
oct | 1407167235657 |
9 | 327512412525 |
10 | 104050015151 |
11 | 40144580465 |
12 | 181ba18117b |
13 | 9a728c3404 |
14 | 5070cb3a35 |
15 | 2a8ea8e1bb |
hex | 1839dd3baf |
104050015151 has 4 divisors (see below), whose sum is σ = 104097768600. Its totient is φ = 104002261704.
The previous prime is 104050015103. The next prime is 104050015163. The reversal of 104050015151 is 151510050401.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-104050015151 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104050015171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23873456 + ... + 23877813.
It is an arithmetic number, because the mean of its divisors is an integer number (26024442150).
Almost surely, 2104050015151 is an apocalyptic number.
104050015151 is a deficient number, since it is larger than the sum of its proper divisors (47753449).
104050015151 is an equidigital number, since it uses as much as digits as its factorization.
104050015151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47753448.
The product of its (nonzero) digits is 500, while the sum is 23.
Adding to 104050015151 its reverse (151510050401), we get a palindrome (255560065552).
The spelling of 104050015151 in words is "one hundred four billion, fifty million, fifteen thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •