Base | Representation |
---|---|
bin | 10001011110001… |
… | …01000001001010 |
3 | 101012202222012222 |
4 | 20233011001022 |
5 | 300004342200 |
6 | 22313134042 |
7 | 3426505601 |
oct | 1057050112 |
9 | 335688188 |
10 | 146559050 |
11 | 75801a90 |
12 | 410ba322 |
13 | 24495941 |
14 | 15670a38 |
15 | cceed85 |
hex | 8bc504a |
146559050 has 48 divisors (see below), whose sum is σ = 304346592. Its totient is φ = 52046400.
The previous prime is 146559047. The next prime is 146559067. The reversal of 146559050 is 50955641.
It is a self number, because there is not a number n which added to its sum of digits gives 146559050.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 20552 + ... + 26748.
It is an arithmetic number, because the mean of its divisors is an integer number (6340554).
Almost surely, 2146559050 is an apocalyptic number.
146559050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
146559050 is an abundant number, since it is smaller than the sum of its proper divisors (157787542).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146559050 is a wasteful number, since it uses less digits than its factorization.
146559050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6263 (or 6258 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 35.
The square root of 146559050 is about 12106.1575241693. The cubic root of 146559050 is about 527.2349768941.
The spelling of 146559050 in words is "one hundred forty-six million, five hundred fifty-nine thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •