Base | Representation |
---|---|
bin | 1000101011000100100… |
… | …1101111111110111011 |
3 | 112020121010200121202211 |
4 | 2022301021233332323 |
5 | 4420123224324011 |
6 | 152241120435551 |
7 | 13523245461160 |
oct | 2126111577673 |
9 | 466533617684 |
10 | 149001011131 |
11 | 58211206015 |
12 | 24a64178bb7 |
13 | 1108760759b |
14 | 72d6c28067 |
15 | 3d2104cb21 |
hex | 22b126ffbb |
149001011131 has 8 divisors (see below), whose sum is σ = 170310535904. Its totient is φ = 127697402880.
The previous prime is 149001011119. The next prime is 149001011143. The reversal of 149001011131 is 131110100941.
It is an interprime number because it is at equal distance from previous prime (149001011119) and next prime (149001011143).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 149001011131 - 211 = 149001009083 is a prime.
It is a super-2 number, since 2×1490010111312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (149001017131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1425030 + ... + 1526011.
It is an arithmetic number, because the mean of its divisors is an integer number (21288816988).
Almost surely, 2149001011131 is an apocalyptic number.
149001011131 is a deficient number, since it is larger than the sum of its proper divisors (21309524773).
149001011131 is an equidigital number, since it uses as much as digits as its factorization.
149001011131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2958261.
The product of its (nonzero) digits is 108, while the sum is 22.
The spelling of 149001011131 in words is "one hundred forty-nine billion, one million, eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •