Base | Representation |
---|---|
bin | 1000101011000101110… |
… | …0101011001010110110 |
3 | 112020121111000200000021 |
4 | 2022301130223022312 |
5 | 4420131012102100 |
6 | 152241415035354 |
7 | 13523335602610 |
oct | 2126134531266 |
9 | 466544020007 |
10 | 149005972150 |
11 | 58213a94332 |
12 | 24a6596bb5a |
13 | 110886536b9 |
14 | 72d7759db0 |
15 | 3d216cca1a |
hex | 22b172b2b6 |
149005972150 has 24 divisors (see below), whose sum is σ = 316744124400. Its totient is φ = 51087761760.
The previous prime is 149005972133. The next prime is 149005972177. The reversal of 149005972150 is 51279500941.
149005972150 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 149005972097 and 149005972106.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 212865325 + ... + 212866024.
It is an arithmetic number, because the mean of its divisors is an integer number (13197671850).
Almost surely, 2149005972150 is an apocalyptic number.
149005972150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
149005972150 is an abundant number, since it is smaller than the sum of its proper divisors (167738152250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
149005972150 is a wasteful number, since it uses less digits than its factorization.
149005972150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 425731368 (or 425731363 counting only the distinct ones).
The product of its (nonzero) digits is 113400, while the sum is 43.
The spelling of 149005972150 in words is "one hundred forty-nine billion, five million, nine hundred seventy-two thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •