Base | Representation |
---|---|
bin | 100010000110110010011000… |
… | …010001110111101000011010 |
3 | 201200002212012101200012222000 |
4 | 202012302120101313220122 |
5 | 124130044441110313100 |
6 | 1251005013442541430 |
7 | 43411066436341350 |
oct | 4206623021675032 |
9 | 650085171605860 |
10 | 149999992666650 |
11 | 43881704406645 |
12 | 149a7006067876 |
13 | 6590c2819c059 |
14 | 290807746b7d0 |
15 | 1251c9d981900 |
hex | 886c98477a1a |
149999992666650 has 96 divisors (see below), whose sum is σ = 472380929316480. Its totient is φ = 34285712607360.
The previous prime is 149999992666619. The next prime is 149999992666651. The reversal of 149999992666650 is 56666299999941.
It is a Harshad number since it is a multiple of its sum of digits (90).
It is not an unprimeable number, because it can be changed into a prime (149999992666651) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 7936498099 + ... + 7936516998.
It is an arithmetic number, because the mean of its divisors is an integer number (4920634680380).
Almost surely, 2149999992666650 is an apocalyptic number.
149999992666650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
149999992666650 is an abundant number, since it is smaller than the sum of its proper divisors (322380936649830).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
149999992666650 is a wasteful number, since it uses less digits than its factorization.
149999992666650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15873015125 (or 15873015114 counting only the distinct ones).
The product of its (nonzero) digits is 27549901440, while the sum is 90.
The spelling of 149999992666650 in words is "one hundred forty-nine trillion, nine hundred ninety-nine billion, nine hundred ninety-two million, six hundred sixty-six thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •