Base | Representation |
---|---|
bin | 100001110111011110010000… |
… | …110011111010000000000001 |
3 | 201112101020210100221002000001 |
4 | 201313132100303322000001 |
5 | 124010324141144242001 |
6 | 1244441325532000001 |
7 | 43242052250464516 |
oct | 4167362063720001 |
9 | 645336710832001 |
10 | 148947600384001 |
11 | 435063603a7301 |
12 | 14857062000001 |
13 | 651591064a743 |
14 | 28ad160ac330d |
15 | 1234707826001 |
hex | 877790cfa001 |
148947600384001 has 4 divisors (see below), whose sum is σ = 151757932466772. Its totient is φ = 146137268301232.
The previous prime is 148947600383971. The next prime is 148947600384029. The reversal of 148947600384001 is 100483006749841.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 127481058144001 + 21466542240000 = 11290751^2 + 4633200^2 .
It is a cyclic number.
It is not a de Polignac number, because 148947600384001 - 217 = 148947600252929 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (148947600384061) 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, 1405166041306 + ... + 1405166041411.
It is an arithmetic number, because the mean of its divisors is an integer number (37939483116693).
Almost surely, 2148947600384001 is an apocalyptic number.
It is an amenable number.
148947600384001 is a deficient number, since it is larger than the sum of its proper divisors (2810332082771).
148947600384001 is an equidigital number, since it uses as much as digits as its factorization.
148947600384001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2810332082770.
The product of its (nonzero) digits is 4644864, while the sum is 55.
The spelling of 148947600384001 in words is "one hundred forty-eight trillion, nine hundred forty-seven billion, six hundred million, three hundred eighty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •