Base | Representation |
---|---|
bin | 1000100000111110000… |
… | …1101000101100101011 |
3 | 111222121011020122212112 |
4 | 2020033201220230223 |
5 | 4344100034120010 |
6 | 151112052432535 |
7 | 13366121034533 |
oct | 2101741505453 |
9 | 458534218775 |
10 | 146289363755 |
11 | 5704a594227 |
12 | 2442801874b |
13 | 10a448a3502 |
14 | 711aa424c3 |
15 | 3c12e66a05 |
hex | 220f868b2b |
146289363755 has 8 divisors (see below), whose sum is σ = 177251579232. Its totient is φ = 115895262528.
The previous prime is 146289363721. The next prime is 146289363799. The reversal of 146289363755 is 557363982641.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 146289363755 - 28 = 146289363499 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 146289363694 and 146289363703.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 142027994 + ... + 142029023.
It is an arithmetic number, because the mean of its divisors is an integer number (22156447404).
Almost surely, 2146289363755 is an apocalyptic number.
146289363755 is a deficient number, since it is larger than the sum of its proper divisors (30962215477).
146289363755 is a wasteful number, since it uses less digits than its factorization.
146289363755 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 284057125.
The product of its digits is 32659200, while the sum is 59.
The spelling of 146289363755 in words is "one hundred forty-six billion, two hundred eighty-nine million, three hundred sixty-three thousand, seven hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •