Base | Representation |
---|---|
bin | 1000101110110010000… |
… | …1100110100100100101 |
3 | 112100011120001011221210 |
4 | 2023230201212210211 |
5 | 4424143230313111 |
6 | 152524022502033 |
7 | 13560032324055 |
oct | 2135441464445 |
9 | 470146034853 |
10 | 149997119781 |
11 | 58682511203 |
12 | 250a1894919 |
13 | 111b5ab14a2 |
14 | 738d241565 |
15 | 3d7d7110a6 |
hex | 22ec866925 |
149997119781 has 4 divisors (see below), whose sum is σ = 199996159712. Its totient is φ = 99998079852.
The previous prime is 149997119743. The next prime is 149997119809. The reversal of 149997119781 is 187911799941.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 149997119781 - 214 = 149997103397 is a prime.
It is a super-2 number, since 2×1499971197812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (149997119381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24999519961 + ... + 24999519966.
It is an arithmetic number, because the mean of its divisors is an integer number (49999039928).
Almost surely, 2149997119781 is an apocalyptic number.
It is an amenable number.
149997119781 is a deficient number, since it is larger than the sum of its proper divisors (49999039931).
149997119781 is an equidigital number, since it uses as much as digits as its factorization.
149997119781 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49999039930.
The product of its digits is 10287648, while the sum is 66.
The spelling of 149997119781 in words is "one hundred forty-nine billion, nine hundred ninety-seven million, one hundred nineteen thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •