Base | Representation |
---|---|
bin | 100001001110011000011001… |
… | …100111110000101101100011 |
3 | 201011101022002100212101220002 |
4 | 201032120121213300231203 |
5 | 123123043024120314201 |
6 | 1234440203400010215 |
7 | 42531045106441364 |
oct | 4116303147605543 |
9 | 634338070771802 |
10 | 146123807198051 |
11 | 426178387a5a91 |
12 | 1447b93346096b |
13 | 636c553942367 |
14 | 2812603d09b6b |
15 | 11d60377b876b |
hex | 84e6199f0b63 |
146123807198051 has 2 divisors, whose sum is σ = 146123807198052. Its totient is φ = 146123807198050.
The previous prime is 146123807198009. The next prime is 146123807198059. The reversal of 146123807198051 is 150891708321641.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-146123807198051 is a prime.
It is not a weakly prime, because it can be changed into another prime (146123807198059) 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 as a sum of consecutive naturals, namely, 73061903599025 + 73061903599026.
It is an arithmetic number, because the mean of its divisors is an integer number (73061903599026).
It is a 1-persistent number, because it is pandigital, but 2⋅146123807198051 = 292247614396102 is not.
Almost surely, 2146123807198051 is an apocalyptic number.
146123807198051 is a deficient number, since it is larger than the sum of its proper divisors (1).
146123807198051 is an equidigital number, since it uses as much as digits as its factorization.
146123807198051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2903040, while the sum is 56.
The spelling of 146123807198051 in words is "one hundred forty-six trillion, one hundred twenty-three billion, eight hundred seven million, one hundred ninety-eight thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •