Base | Representation |
---|---|
bin | 100001101010110110100001… |
… | …101011111010011101010001 |
3 | 201102022100010201110001200210 |
4 | 201222312201223322131101 |
5 | 123402121423311420401 |
6 | 1242535052321034333 |
7 | 43122306610665231 |
oct | 4152664153723521 |
9 | 642270121401623 |
10 | 148080300107601 |
11 | 43201558a68874 |
12 | 14736b54a859a9 |
13 | 6481bb2674414 |
14 | 287d1a6505cc1 |
15 | 121bd95e514d6 |
hex | 86ada1afa751 |
148080300107601 has 4 divisors (see below), whose sum is σ = 197440400143472. Its totient is φ = 98720200071732.
The previous prime is 148080300107563. The next prime is 148080300107633. The reversal of 148080300107601 is 106701003080841.
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 148080300107601 - 210 = 148080300106577 is a prime.
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 148080300107601.
It is not an unprimeable number, because it can be changed into a prime (148080300107681) 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, 24680050017931 + ... + 24680050017936.
It is an arithmetic number, because the mean of its divisors is an integer number (49360100035868).
Almost surely, 2148080300107601 is an apocalyptic number.
It is an amenable number.
148080300107601 is a deficient number, since it is larger than the sum of its proper divisors (49360100035871).
148080300107601 is an equidigital number, since it uses as much as digits as its factorization.
148080300107601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49360100035870.
The product of its (nonzero) digits is 32256, while the sum is 39.
The spelling of 148080300107601 in words is "one hundred forty-eight trillion, eighty billion, three hundred million, one hundred seven thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •