Base | Representation |
---|---|
bin | 1000110000010101010… |
… | …0011111010100100101 |
3 | 112101020112210210211201 |
4 | 2030011110133110211 |
5 | 4431021224100423 |
6 | 153033203002501 |
7 | 13603243235131 |
oct | 2140524372445 |
9 | 471215723751 |
10 | 150413112613 |
11 | 5887630a835 |
12 | 25199069431 |
13 | 112510322aa |
14 | 73cc5aa3c1 |
15 | 3da4ed32ad |
hex | 230551f525 |
150413112613 has 4 divisors (see below), whose sum is σ = 151168957600. Its totient is φ = 149657267628.
The previous prime is 150413112593. The next prime is 150413112643. The reversal of 150413112613 is 316211314051.
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.
It is a cyclic number.
It is not a de Polignac number, because 150413112613 - 213 = 150413104421 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 (150413112643) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 377922195 + ... + 377922592.
It is an arithmetic number, because the mean of its divisors is an integer number (37792239400).
Almost surely, 2150413112613 is an apocalyptic number.
It is an amenable number.
150413112613 is a deficient number, since it is larger than the sum of its proper divisors (755844987).
150413112613 is an equidigital number, since it uses as much as digits as its factorization.
150413112613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 755844986.
The product of its (nonzero) digits is 2160, while the sum is 28.
Adding to 150413112613 its reverse (316211314051), we get a palindrome (466624426664).
The spelling of 150413112613 in words is "one hundred fifty billion, four hundred thirteen million, one hundred twelve thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •