Base | Representation |
---|---|
bin | 10010000000011… |
… | …01001100001010 |
3 | 101112020002020022 |
4 | 21000031030022 |
5 | 302132031340 |
6 | 22553300442 |
7 | 3512616002 |
oct | 1100151412 |
9 | 345202208 |
10 | 151048970 |
11 | 78299366 |
12 | 42704722 |
13 | 253a84b7 |
14 | 160bd002 |
15 | d3da3b5 |
hex | 900d30a |
151048970 has 8 divisors (see below), whose sum is σ = 271888164. Its totient is φ = 60419584.
The previous prime is 151048969. The next prime is 151048973. The reversal of 151048970 is 79840151.
It can be written as a sum of positive squares in 2 ways, for example, as 149108521 + 1940449 = 12211^2 + 1393^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 151048970.
It is not an unprimeable number, because it can be changed into a prime (151048973) 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, 7552439 + ... + 7552458.
Almost surely, 2151048970 is an apocalyptic number.
151048970 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
151048970 is a deficient number, since it is larger than the sum of its proper divisors (120839194).
151048970 is a wasteful number, since it uses less digits than its factorization.
151048970 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15104904.
The product of its (nonzero) digits is 10080, while the sum is 35.
The square root of 151048970 is about 12290.1981269628. The cubic root of 151048970 is about 532.5649608128.
The spelling of 151048970 in words is "one hundred fifty-one million, forty-eight thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •