Base | Representation |
---|---|
bin | 1000100000111101100… |
… | …0101111111110010101 |
3 | 111222120222212022101222 |
4 | 2020033120233332111 |
5 | 4344043440044021 |
6 | 151111530500125 |
7 | 13366062163154 |
oct | 2101730577625 |
9 | 458528768358 |
10 | 146287034261 |
11 | 57049243025 |
12 | 24427294645 |
13 | 10a44269104 |
14 | 711a5d759b |
15 | 3c12b566ab |
hex | 220f62ff95 |
146287034261 has 2 divisors, whose sum is σ = 146287034262. Its totient is φ = 146287034260.
The previous prime is 146287034209. The next prime is 146287034263. The reversal of 146287034261 is 162430782641.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 81424622500 + 64862411761 = 285350^2 + 254681^2 .
It is an emirp because it is prime and its reverse (162430782641) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 146287034261 - 222 = 146282839957 is a prime.
It is a super-2 number, since 2×1462870342612 (a number of 23 digits) contains 22 as substring.
Together with 146287034263, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (146287034263) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73143517130 + 73143517131.
It is an arithmetic number, because the mean of its divisors is an integer number (73143517131).
Almost surely, 2146287034261 is an apocalyptic number.
It is an amenable number.
146287034261 is a deficient number, since it is larger than the sum of its proper divisors (1).
146287034261 is an equidigital number, since it uses as much as digits as its factorization.
146287034261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 387072, while the sum is 44.
The spelling of 146287034261 in words is "one hundred forty-six billion, two hundred eighty-seven million, thirty-four thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •