Base | Representation |
---|---|
bin | 1000110001011001001… |
… | …1001001010011101010 |
3 | 112101222101211012210022 |
4 | 2030112103021103222 |
5 | 4432112140113340 |
6 | 153121340320442 |
7 | 13613302430606 |
oct | 2142623112352 |
9 | 471871735708 |
10 | 150697972970 |
11 | 58a02093616 |
12 | 25258543122 |
13 | 1129805c00c |
14 | 741835c506 |
15 | 3dc00013b5 |
hex | 23164c94ea |
150697972970 has 8 divisors (see below), whose sum is σ = 271256351364. Its totient is φ = 60279189184.
The previous prime is 150697972949. The next prime is 150697972973. The reversal of 150697972970 is 79279796051.
It can be written as a sum of positive squares in 2 ways, for example, as 143916285769 + 6781687201 = 379363^2 + 82351^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (150697972973) 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, 7534898639 + ... + 7534898658.
Almost surely, 2150697972970 is an apocalyptic number.
150697972970 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
150697972970 is a deficient number, since it is larger than the sum of its proper divisors (120558378394).
150697972970 is a wasteful number, since it uses less digits than its factorization.
150697972970 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15069797304.
The product of its (nonzero) digits is 15002820, while the sum is 62.
The spelling of 150697972970 in words is "one hundred fifty billion, six hundred ninety-seven million, nine hundred seventy-two thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •