Base | Representation |
---|---|
bin | 1000100001111011010… |
… | …1111110000000010111 |
3 | 112000021001211000200021 |
4 | 2020132311332000113 |
5 | 4400111331232101 |
6 | 151153352530011 |
7 | 13405361304043 |
oct | 2103665760027 |
9 | 460231730607 |
10 | 146546352151 |
11 | 57171660431 |
12 | 2449a0b0907 |
13 | 10a85bc1a54 |
14 | 7142c1b023 |
15 | 3c2a7cb5a1 |
hex | 221ed7e017 |
146546352151 has 2 divisors, whose sum is σ = 146546352152. Its totient is φ = 146546352150.
The previous prime is 146546352107. The next prime is 146546352179. The reversal of 146546352151 is 151253645641.
146546352151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 146546352151 - 215 = 146546319383 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 146546352098 and 146546352107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (146546352191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73273176075 + 73273176076.
It is an arithmetic number, because the mean of its divisors is an integer number (73273176076).
Almost surely, 2146546352151 is an apocalyptic number.
146546352151 is a deficient number, since it is larger than the sum of its proper divisors (1).
146546352151 is an equidigital number, since it uses as much as digits as its factorization.
146546352151 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 432000, while the sum is 43.
Adding to 146546352151 its reverse (151253645641), we get a palindrome (297799997792).
The spelling of 146546352151 in words is "one hundred forty-six billion, five hundred forty-six million, three hundred fifty-two thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •