Base | Representation |
---|---|
bin | 1000101101111000101… |
… | …1010001100001111001 |
3 | 112022112210001121110122 |
4 | 2023132023101201321 |
5 | 4423200113313101 |
6 | 152444103023025 |
7 | 13551050162420 |
oct | 2133613214171 |
9 | 468483047418 |
10 | 149756385401 |
11 | 58569636977 |
12 | 2503513aa75 |
13 | 11177c642cc |
14 | 73692982b7 |
15 | 3d6750c51b |
hex | 22de2d1879 |
149756385401 has 8 divisors (see below), whose sum is σ = 171409086144. Its totient is φ = 128168417520.
The previous prime is 149756385319. The next prime is 149756385407. The reversal of 149756385401 is 104583657941.
149756385401 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-149756385401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (149756385407) 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 7 ways as a sum of consecutive naturals, for example, 16178255 + ... + 16187508.
It is an arithmetic number, because the mean of its divisors is an integer number (21426135768).
Almost surely, 2149756385401 is an apocalyptic number.
It is an amenable number.
149756385401 is a deficient number, since it is larger than the sum of its proper divisors (21652700743).
149756385401 is an equidigital number, since it uses as much as digits as its factorization.
149756385401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32366431.
The product of its (nonzero) digits is 3628800, while the sum is 53.
The spelling of 149756385401 in words is "one hundred forty-nine billion, seven hundred fifty-six million, three hundred eighty-five thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •