Base | Representation |
---|---|
bin | 100001001101010010011000… |
… | …011100110010010001011110 |
3 | 201011010010000211110022122220 |
4 | 201031102120130302101132 |
5 | 123120330041124202331 |
6 | 1234341451245450210 |
7 | 42522444043516413 |
oct | 4115223034622136 |
9 | 634103024408586 |
10 | 146048625615966 |
11 | 42598968753677 |
12 | 14469251270966 |
13 | 6365431b60108 |
14 | 280cb1108610a |
15 | 11d40d7334296 |
hex | 84d49873245e |
146048625615966 has 32 divisors (see below), whose sum is σ = 292183011533088. Its totient is φ = 48668583912960.
The previous prime is 146048625615869. The next prime is 146048625615967. The reversal of 146048625615966 is 669516526840641.
It is a super-2 number, since 2×1460486256159662 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 146048625615966.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146048625615967) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 286767706 + ... + 287276546.
It is an arithmetic number, because the mean of its divisors is an integer number (9130719110409).
Almost surely, 2146048625615966 is an apocalyptic number.
146048625615966 is an abundant number, since it is smaller than the sum of its proper divisors (146134385917122).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146048625615966 is a wasteful number, since it uses less digits than its factorization.
146048625615966 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 522796.
The product of its (nonzero) digits is 447897600, while the sum is 69.
The spelling of 146048625615966 in words is "one hundred forty-six trillion, forty-eight billion, six hundred twenty-five million, six hundred fifteen thousand, nine hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •