Base | Representation |
---|---|
bin | 1000101001111100100… |
… | …0000010001001001101 |
3 | 112012211001121002101010 |
4 | 2022133020002021031 |
5 | 4414013313240331 |
6 | 152151114235433 |
7 | 13512614000415 |
oct | 2123710021115 |
9 | 465731532333 |
10 | 148698571341 |
11 | 58076515581 |
12 | 2499aa25b79 |
13 | 11039a64128 |
14 | 72a89bb645 |
15 | 3d0470ae46 |
hex | 229f20224d |
148698571341 has 4 divisors (see below), whose sum is σ = 198264761792. Its totient is φ = 99132380892.
The previous prime is 148698571321. The next prime is 148698571349. The reversal of 148698571341 is 143175896841.
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, and also an emirpimes, since its reverse is a distinct semiprime: 143175896841 = 3 ⋅47725298947.
It is not a de Polignac number, because 148698571341 - 25 = 148698571309 is a prime.
It is a super-2 number, since 2×1486985713412 (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 (148698571349) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24783095221 + ... + 24783095226.
It is an arithmetic number, because the mean of its divisors is an integer number (49566190448).
Almost surely, 2148698571341 is an apocalyptic number.
It is an amenable number.
148698571341 is a deficient number, since it is larger than the sum of its proper divisors (49566190451).
148698571341 is an equidigital number, since it uses as much as digits as its factorization.
148698571341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49566190450.
The product of its digits is 5806080, while the sum is 57.
The spelling of 148698571341 in words is "one hundred forty-eight billion, six hundred ninety-eight million, five hundred seventy-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •