Base | Representation |
---|---|
bin | 100001010111000111000000… |
… | …000101110010111011100101 |
3 | 201020111122020222212022120121 |
4 | 201113013000011302323211 |
5 | 123212404413214342321 |
6 | 1240015520325001541 |
7 | 42622300412655034 |
oct | 4127070005627345 |
9 | 636448228768517 |
10 | 146723600543461 |
11 | 42829147480967 |
12 | 14558024b532b1 |
13 | 63b3c8c825636 |
14 | 283366295871b |
15 | 11e693e415441 |
hex | 8571c0172ee5 |
146723600543461 has 2 divisors, whose sum is σ = 146723600543462. Its totient is φ = 146723600543460.
The previous prime is 146723600543411. The next prime is 146723600543491. The reversal of 146723600543461 is 164345006327641.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 81649838160900 + 65073762382561 = 9036030^2 + 8066831^2 .
It is a cyclic number.
It is not a de Polignac number, because 146723600543461 - 213 = 146723600535269 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 146723600543399 and 146723600543408.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (146723600543411) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73361800271730 + 73361800271731.
It is an arithmetic number, because the mean of its divisors is an integer number (73361800271731).
Almost surely, 2146723600543461 is an apocalyptic number.
It is an amenable number.
146723600543461 is a deficient number, since it is larger than the sum of its proper divisors (1).
146723600543461 is an equidigital number, since it uses as much as digits as its factorization.
146723600543461 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8709120, while the sum is 52.
The spelling of 146723600543461 in words is "one hundred forty-six trillion, seven hundred twenty-three billion, six hundred million, five hundred forty-three thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •