Base | Representation |
---|---|
bin | 1000100001001000011… |
… | …0100111001100000010 |
3 | 111222201011121212101120 |
4 | 2020102012213030002 |
5 | 4344142122030310 |
6 | 151120235413110 |
7 | 13400154450003 |
oct | 2102206471402 |
9 | 458634555346 |
10 | 146332611330 |
11 | 57071a42824 |
12 | 2443a5b4196 |
13 | 10a508362a9 |
14 | 712269d1aa |
15 | 3c16b5ab70 |
hex | 22121a7302 |
146332611330 has 32 divisors (see below), whose sum is σ = 355429577664. Its totient is φ = 38551884096.
The previous prime is 146332611283. The next prime is 146332611331. The reversal of 146332611330 is 33116233641.
It is a junction number, because it is equal to n+sod(n) for n = 146332611291 and 146332611300.
It is not an unprimeable number, because it can be changed into a prime (146332611331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29381569 + ... + 29386548.
It is an arithmetic number, because the mean of its divisors is an integer number (11107174302).
Almost surely, 2146332611330 is an apocalyptic number.
146332611330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
146332611330 is an abundant number, since it is smaller than the sum of its proper divisors (209096966334).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146332611330 is a wasteful number, since it uses less digits than its factorization.
146332611330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58768210.
The product of its (nonzero) digits is 23328, while the sum is 33.
Adding to 146332611330 its reverse (33116233641), we get a palindrome (179448844971).
The spelling of 146332611330 in words is "one hundred forty-six billion, three hundred thirty-two million, six hundred eleven thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •