Base | Representation |
---|---|
bin | 100001001110110000111001… |
… | …000111110111000010100011 |
3 | 201011110210222010210001221122 |
4 | 201032300321013313002203 |
5 | 123124010404002310201 |
6 | 1234500233120042455 |
7 | 42532665600423056 |
oct | 4116607107670243 |
9 | 634423863701848 |
10 | 146150105510051 |
11 | 42627a03487035 |
12 | 14484a5276342b |
13 | 6371b85142416 |
14 | 28139ba894a9d |
15 | 11d6a76445e1b |
hex | 84ec391f70a3 |
146150105510051 has 64 divisors (see below), whose sum is σ = 163348606039680. Its totient is φ = 130163019816960.
The previous prime is 146150105510021. The next prime is 146150105510083. The reversal of 146150105510051 is 150015501051641.
It is a cyclic number.
It is not a de Polignac number, because 146150105510051 - 210 = 146150105509027 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 146150105509993 and 146150105510020.
It is not an unprimeable number, because it can be changed into a prime (146150105510021) 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 63 ways as a sum of consecutive naturals, for example, 1891602761 + ... + 1891680021.
It is an arithmetic number, because the mean of its divisors is an integer number (2552321969370).
Almost surely, 2146150105510051 is an apocalyptic number.
146150105510051 is a deficient number, since it is larger than the sum of its proper divisors (17198500529629).
146150105510051 is a wasteful number, since it uses less digits than its factorization.
146150105510051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77864.
The product of its (nonzero) digits is 15000, while the sum is 35.
Adding to 146150105510051 its reverse (150015501051641), we get a palindrome (296165606561692).
The spelling of 146150105510051 in words is "one hundred forty-six trillion, one hundred fifty billion, one hundred five million, five hundred ten thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •