Base | Representation |
---|---|
bin | 100001101010001101111001… |
… | …010101100000001110110011 |
3 | 201102011011112022020022121102 |
4 | 201222031321111200032303 |
5 | 123400413101402041121 |
6 | 1242503035310515015 |
7 | 43116203525464124 |
oct | 4152157125401663 |
9 | 642134468208542 |
10 | 148036673471411 |
11 | 4319500095933a |
12 | 1472a5ba505a6b |
13 | 647aa4c146baa |
14 | 287b02841404b |
15 | 121ab90d9590b |
hex | 86a3795603b3 |
148036673471411 has 12 divisors (see below), whose sum is σ = 152240478718608. Its totient is φ = 143946049987872.
The previous prime is 148036673471389. The next prime is 148036673471441. The reversal of 148036673471411 is 114174376630841.
It is a de Polignac number, because none of the positive numbers 2k-148036673471411 is a prime.
It is a super-2 number, since 2×1480366734714112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (148036673471441) 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 11 ways as a sum of consecutive naturals, for example, 31444976 + ... + 35844941.
It is an arithmetic number, because the mean of its divisors is an integer number (12686706559884).
Almost surely, 2148036673471411 is an apocalyptic number.
148036673471411 is a deficient number, since it is larger than the sum of its proper divisors (4203805247197).
148036673471411 is an equidigital number, since it uses as much as digits as its factorization.
148036673471411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67291598 (or 67291561 counting only the distinct ones).
The product of its (nonzero) digits is 8128512, while the sum is 56.
The spelling of 148036673471411 in words is "one hundred forty-eight trillion, thirty-six billion, six hundred seventy-three million, four hundred seventy-one thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •