Base | Representation |
---|---|
bin | 1000100000011011111… |
… | …1111100000101010011 |
3 | 111222020012001220111001 |
4 | 2020012333330011103 |
5 | 4343301424000111 |
6 | 151045542402431 |
7 | 13362433105552 |
oct | 2100677740523 |
9 | 458205056431 |
10 | 146146312531 |
11 | 56a8686877a |
12 | 243a8130417 |
13 | 10a2106840b |
14 | 7105a45d99 |
15 | 3c0560b1c1 |
hex | 2206ffc153 |
146146312531 has 2 divisors, whose sum is σ = 146146312532. Its totient is φ = 146146312530.
The previous prime is 146146312447. The next prime is 146146312541. The reversal of 146146312531 is 135213641641.
146146312531 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 146146312531 - 221 = 146144215379 is a prime.
It is a super-2 number, since 2×1461463125312 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (146146312541) 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, 73073156265 + 73073156266.
It is an arithmetic number, because the mean of its divisors is an integer number (73073156266).
Almost surely, 2146146312531 is an apocalyptic number.
146146312531 is a deficient number, since it is larger than the sum of its proper divisors (1).
146146312531 is an equidigital number, since it uses as much as digits as its factorization.
146146312531 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 51840, while the sum is 37.
The spelling of 146146312531 in words is "one hundred forty-six billion, one hundred forty-six million, three hundred twelve thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •