Base | Representation |
---|---|
bin | 1000100000010101101… |
… | …0111010011101110011 |
3 | 111222011100020102101222 |
4 | 2020011122322131303 |
5 | 4343223134014423 |
6 | 151043155015255 |
7 | 13361662025264 |
oct | 2100532723563 |
9 | 458140212358 |
10 | 146119829363 |
11 | 56a7291a562 |
12 | 2439b29a52b |
13 | 10a187250c1 |
14 | 710231096b |
15 | 3c031293c8 |
hex | 22056ba773 |
146119829363 has 2 divisors, whose sum is σ = 146119829364. Its totient is φ = 146119829362.
The previous prime is 146119829351. The next prime is 146119829369. The reversal of 146119829363 is 363928911641.
146119829363 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 146119829363 - 216 = 146119763827 is a prime.
It is not a weakly prime, because it can be changed into another prime (146119829369) 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, 73059914681 + 73059914682.
It is an arithmetic number, because the mean of its divisors is an integer number (73059914682).
Almost surely, 2146119829363 is an apocalyptic number.
146119829363 is a deficient number, since it is larger than the sum of its proper divisors (1).
146119829363 is an equidigital number, since it uses as much as digits as its factorization.
146119829363 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1679616, while the sum is 53.
The spelling of 146119829363 in words is "one hundred forty-six billion, one hundred nineteen million, eight hundred twenty-nine thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •