Base | Representation |
---|---|
bin | 1000100000010001011… |
… | …1010011100100001001 |
3 | 111222010002220000001002 |
4 | 2020010113103210021 |
5 | 4343204114401002 |
6 | 151041323104345 |
7 | 13361355261623 |
oct | 2100427234411 |
9 | 458102800032 |
10 | 146102106377 |
11 | 56a63914a67 |
12 | 243953720b5 |
13 | 10a14b5b226 |
14 | 70ddc19c13 |
15 | 3c017c8002 |
hex | 22045d3909 |
146102106377 has 2 divisors, whose sum is σ = 146102106378. Its totient is φ = 146102106376.
The previous prime is 146102106347. The next prime is 146102106407. The reversal of 146102106377 is 773601201641.
It is a balanced prime because it is at equal distance from previous prime (146102106347) and next prime (146102106407).
It can be written as a sum of positive squares in only one way, i.e., 109902858256 + 36199248121 = 331516^2 + 190261^2 .
It is a cyclic number.
It is not a de Polignac number, because 146102106377 - 26 = 146102106313 is a prime.
It is a super-2 number, since 2×1461021063772 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 146102106377.
It is not a weakly prime, because it can be changed into another prime (146102106307) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73051053188 + 73051053189.
It is an arithmetic number, because the mean of its divisors is an integer number (73051053189).
Almost surely, 2146102106377 is an apocalyptic number.
It is an amenable number.
146102106377 is a deficient number, since it is larger than the sum of its proper divisors (1).
146102106377 is an equidigital number, since it uses as much as digits as its factorization.
146102106377 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 42336, while the sum is 38.
The spelling of 146102106377 in words is "one hundred forty-six billion, one hundred two million, one hundred six thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •