Base | Representation |
---|---|
bin | 100001010000011000100011… |
… | …111111110010101001001011 |
3 | 201011212110021212001101111210 |
4 | 201100120203333302221023 |
5 | 123132321342034114201 |
6 | 1235023322512424203 |
7 | 42544016225033040 |
oct | 4120304377625113 |
9 | 634773255041453 |
10 | 146261420223051 |
11 | 42670135763511 |
12 | 144a2539848063 |
13 | 637c514b290c3 |
14 | 281913a5091c7 |
15 | 11d98ddb881d6 |
hex | 850623ff2a4b |
146261420223051 has 32 divisors (see below), whose sum is σ = 222959329975296. Its totient is φ = 83546163792000.
The previous prime is 146261420222971. The next prime is 146261420223089. The reversal of 146261420223051 is 150322024162641.
It is not a de Polignac number, because 146261420223051 - 218 = 146261419960907 is a prime.
It is not an unprimeable number, because it can be changed into a prime (146261420221051) 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 in 31 ways as a sum of consecutive naturals, for example, 1081579621 + ... + 1081714841.
It is an arithmetic number, because the mean of its divisors is an integer number (6967479061728).
Almost surely, 2146261420223051 is an apocalyptic number.
146261420223051 is a deficient number, since it is larger than the sum of its proper divisors (76697909752245).
146261420223051 is a wasteful number, since it uses less digits than its factorization.
146261420223051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154443.
The product of its (nonzero) digits is 138240, while the sum is 39.
Adding to 146261420223051 its reverse (150322024162641), we get a palindrome (296583444385692).
The spelling of 146261420223051 in words is "one hundred forty-six trillion, two hundred sixty-one billion, four hundred twenty million, two hundred twenty-three thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •