Base | Representation |
---|---|
bin | 10010000000000… |
… | …00100011100111 |
3 | 101112010110020202 |
4 | 21000000203213 |
5 | 302123402343 |
6 | 22552221115 |
7 | 3512312066 |
oct | 1100004347 |
9 | 345113222 |
10 | 150997223 |
11 | 782634a3 |
12 | 4269a79b |
13 | 2538aa90 |
14 | 160a81dd |
15 | d3c9db8 |
hex | 90008e7 |
150997223 has 8 divisors (see below), whose sum is σ = 164133648. Its totient is φ = 138078144.
The previous prime is 150997211. The next prime is 150997261. The reversal of 150997223 is 322799051.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-150997223 is a prime.
It is a super-2 number, since 2×1509972232 = 45600322707423458, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150997823) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 52886 + ... + 55667.
It is an arithmetic number, because the mean of its divisors is an integer number (20516706).
Almost surely, 2150997223 is an apocalyptic number.
150997223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
150997223 is a deficient number, since it is larger than the sum of its proper divisors (13136425).
150997223 is a wasteful number, since it uses less digits than its factorization.
150997223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108673.
The product of its (nonzero) digits is 34020, while the sum is 38.
The square root of 150997223 is about 12288.0927323975. The cubic root of 150997223 is about 532.5041377418.
It can be divided in two parts, 15099 and 7223, that added together give a palindrome (22322).
The spelling of 150997223 in words is "one hundred fifty million, nine hundred ninety-seven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •