Base | Representation |
---|---|
bin | 1000101101110001111… |
… | …1111110000011100111 |
3 | 112022110211010111111112 |
4 | 2023130133332003213 |
5 | 4423120413144411 |
6 | 152441220055235 |
7 | 13550256115241 |
oct | 2133437760347 |
9 | 468424114445 |
10 | 149728256231 |
11 | 58554774024 |
12 | 2502783451b |
13 | 11172195a28 |
14 | 7365655091 |
15 | 3d64d02b8b |
hex | 22dc7fe0e7 |
149728256231 has 6 divisors (see below), whose sum is σ = 151996365360. Its totient is φ = 147493501716.
The previous prime is 149728256207. The next prime is 149728256233. The reversal of 149728256231 is 132652827941.
It is a de Polignac number, because none of the positive numbers 2k-149728256231 is a prime.
It is a super-2 number, since 2×1497282562312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 149728256231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (149728256233) 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 5 ways as a sum of consecutive naturals, for example, 16672751 + ... + 16681728.
It is an arithmetic number, because the mean of its divisors is an integer number (25332727560).
Almost surely, 2149728256231 is an apocalyptic number.
149728256231 is a deficient number, since it is larger than the sum of its proper divisors (2268109129).
149728256231 is an frugal number, since it uses more digits than its factorization.
149728256231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33354613 (or 33354546 counting only the distinct ones).
The product of its digits is 1451520, while the sum is 50.
The spelling of 149728256231 in words is "one hundred forty-nine billion, seven hundred twenty-eight million, two hundred fifty-six thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •