Base | Representation |
---|---|
bin | 100001010010011010001111… |
… | …101101101010010110101111 |
3 | 201012100202201011020020002212 |
4 | 201102122033231222112233 |
5 | 123142112031042111221 |
6 | 1235211312044441035 |
7 | 42560045663506403 |
oct | 4122321755522657 |
9 | 635322634206085 |
10 | 146400666363311 |
11 | 427141a0560678 |
12 | 1450551ab4917b |
13 | 638c6a6471839 |
14 | 2821b8997d103 |
15 | 11dd33d5e8b5b |
hex | 85268fb6a5af |
146400666363311 has 2 divisors, whose sum is σ = 146400666363312. Its totient is φ = 146400666363310.
The previous prime is 146400666363307. The next prime is 146400666363313. The reversal of 146400666363311 is 113363666004641.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 146400666363311 - 22 = 146400666363307 is a prime.
It is a super-2 number, since 2×1464006663633112 (a number of 29 digits) contains 22 as substring.
Together with 146400666363313, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 146400666363311.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (146400666363313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73200333181655 + 73200333181656.
It is an arithmetic number, because the mean of its divisors is an integer number (73200333181656).
Almost surely, 2146400666363311 is an apocalyptic number.
146400666363311 is a deficient number, since it is larger than the sum of its proper divisors (1).
146400666363311 is an equidigital number, since it uses as much as digits as its factorization.
146400666363311 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3359232, while the sum is 50.
The spelling of 146400666363311 in words is "one hundred forty-six trillion, four hundred billion, six hundred sixty-six million, three hundred sixty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •