Base | Representation |
---|---|
bin | 1000101011001010111… |
… | …1001111000101001010 |
3 | 112020122222202020111011 |
4 | 2022302233033011022 |
5 | 4420202032140200 |
6 | 152243510554134 |
7 | 13524020553466 |
oct | 2126257170512 |
9 | 466588666434 |
10 | 149027615050 |
11 | 58225226a26 |
12 | 24a7106894a |
13 | 1108cc90852 |
14 | 72da5914a6 |
15 | 3d235555ba |
hex | 22b2bcf14a |
149027615050 has 24 divisors (see below), whose sum is σ = 277678572300. Its totient is φ = 59506270080.
The previous prime is 149027614999. The next prime is 149027615057. The reversal of 149027615050 is 50516720941.
149027615050 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 24211671201 + 124815943849 = 155601^2 + 353293^2 .
It is a junction number, because it is equal to n+sod(n) for n = 149027614994 and 149027615012.
It is not an unprimeable number, because it can be changed into a prime (149027615057) by changing a digit.
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, 2590665 + ... + 2647564.
Almost surely, 2149027615050 is an apocalyptic number.
149027615050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
149027615050 is a deficient number, since it is larger than the sum of its proper divisors (128650957250).
149027615050 is a wasteful number, since it uses less digits than its factorization.
149027615050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5238810 (or 5238805 counting only the distinct ones).
The product of its (nonzero) digits is 75600, while the sum is 40.
The spelling of 149027615050 in words is "one hundred forty-nine billion, twenty-seven million, six hundred fifteen thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •