Base | Representation |
---|---|
bin | 10001011110001… |
… | …00000101011110 |
3 | 101012202202222111 |
4 | 20233010011132 |
5 | 300004231410 |
6 | 22313104234 |
7 | 3426461503 |
oct | 1057040536 |
9 | 335682874 |
10 | 146555230 |
11 | 757aa128 |
12 | 410b807a |
13 | 24493c93 |
14 | 1566d4aa |
15 | ccedb8a |
hex | 8bc415e |
146555230 has 8 divisors (see below), whose sum is σ = 263799432. Its totient is φ = 58622088.
The previous prime is 146555219. The next prime is 146555239. The reversal of 146555230 is 32555641.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×1465552303 (a number of 25 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 146555192 and 146555201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146555239) 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 3 ways as a sum of consecutive naturals, for example, 7327752 + ... + 7327771.
It is an arithmetic number, because the mean of its divisors is an integer number (32974929).
Almost surely, 2146555230 is an apocalyptic number.
146555230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
146555230 is a deficient number, since it is larger than the sum of its proper divisors (117244202).
146555230 is a wasteful number, since it uses less digits than its factorization.
146555230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14655530.
The product of its (nonzero) digits is 18000, while the sum is 31.
The square root of 146555230 is about 12105.9997521890. Note that the first 3 decimals coincide. The cubic root of 146555230 is about 527.2303961350.
The spelling of 146555230 in words is "one hundred forty-six million, five hundred fifty-five thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •