Base | Representation |
---|---|
bin | 1000110010111011111… |
… | …0111011010011010011 |
3 | 112110001021002012120010 |
4 | 2030232332323103103 |
5 | 4433434144244443 |
6 | 153230412450003 |
7 | 13626461453262 |
oct | 2145676732323 |
9 | 473037065503 |
10 | 151112103123 |
11 | 590a492a743 |
12 | 25353179903 |
13 | 11332aaa047 |
14 | 74573605d9 |
15 | 3de6556733 |
hex | 232efbb4d3 |
151112103123 has 4 divisors (see below), whose sum is σ = 201482804168. Its totient is φ = 100741402080.
The previous prime is 151112103113. The next prime is 151112103193. The reversal of 151112103123 is 321301211151.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 151112103123 - 217 = 151111972051 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 151112103123.
It is not an unprimeable number, because it can be changed into a prime (151112103113) 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, 25185350518 + ... + 25185350523.
It is an arithmetic number, because the mean of its divisors is an integer number (50370701042).
Almost surely, 2151112103123 is an apocalyptic number.
151112103123 is a deficient number, since it is larger than the sum of its proper divisors (50370701045).
151112103123 is an equidigital number, since it uses as much as digits as its factorization.
151112103123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50370701044.
The product of its (nonzero) digits is 180, while the sum is 21.
Adding to 151112103123 its reverse (321301211151), we get a palindrome (472413314274).
The spelling of 151112103123 in words is "one hundred fifty-one billion, one hundred twelve million, one hundred three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •