Base | Representation |
---|---|
bin | 100001011001001111101001… |
… | …111011000000101110011001 |
3 | 201021000122222220120101112001 |
4 | 201121033221323000232121 |
5 | 123222310414244410023 |
6 | 1240211144305121001 |
7 | 42636013503244156 |
oct | 4131175173005631 |
9 | 637018886511461 |
10 | 146870331247513 |
11 | 428853a30a6635 |
12 | 14580554929161 |
13 | 63c4a74983043 |
14 | 283a7c204322d |
15 | 11ea67aea96ad |
hex | 8593e9ec0b99 |
146870331247513 has 2 divisors, whose sum is σ = 146870331247514. Its totient is φ = 146870331247512.
The previous prime is 146870331247483. The next prime is 146870331247643. The reversal of 146870331247513 is 315742133078641.
146870331247513 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 145683161925184 + 1187169322329 = 12069928^2 + 1089573^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-146870331247513 is a prime.
It is not a weakly prime, because it can be changed into another prime (146870331247813) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73435165623756 + 73435165623757.
It is an arithmetic number, because the mean of its divisors is an integer number (73435165623757).
Almost surely, 2146870331247513 is an apocalyptic number.
It is an amenable number.
146870331247513 is a deficient number, since it is larger than the sum of its proper divisors (1).
146870331247513 is an equidigital number, since it uses as much as digits as its factorization.
146870331247513 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10160640, while the sum is 55.
The spelling of 146870331247513 in words is "one hundred forty-six trillion, eight hundred seventy billion, three hundred thirty-one million, two hundred forty-seven thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •