Base | Representation |
---|---|
bin | 1000101100110110100… |
… | …1100100001101110110 |
3 | 112021211110022202001022 |
4 | 2023031221210031312 |
5 | 4422113123113330 |
6 | 152400400101142 |
7 | 13541142333662 |
oct | 2131551441566 |
9 | 467743282038 |
10 | 149479113590 |
11 | 58437076514 |
12 | 24b783047b2 |
13 | 11132693651 |
14 | 734051d8a2 |
15 | 3d4cedcae5 |
hex | 22cda64376 |
149479113590 has 32 divisors (see below), whose sum is σ = 280438419456. Its totient is φ = 57301094880.
The previous prime is 149479113583. The next prime is 149479113593. The reversal of 149479113590 is 95311974941.
149479113590 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (149479113593) 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 15 ways as a sum of consecutive naturals, for example, 2308802 + ... + 2372661.
It is an arithmetic number, because the mean of its divisors is an integer number (8763700608).
Almost surely, 2149479113590 is an apocalyptic number.
149479113590 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
149479113590 is a deficient number, since it is larger than the sum of its proper divisors (130959305866).
149479113590 is a wasteful number, since it uses less digits than its factorization.
149479113590 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4681604.
The product of its (nonzero) digits is 1224720, while the sum is 53.
The spelling of 149479113590 in words is "one hundred forty-nine billion, four hundred seventy-nine million, one hundred thirteen thousand, five hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •