Base | Representation |
---|---|
bin | 10001100001001… |
… | …01011101000010 |
3 | 101020112001001121 |
4 | 20300211131002 |
5 | 300110012200 |
6 | 22325422454 |
7 | 3433042315 |
oct | 1060453502 |
9 | 336461047 |
10 | 146954050 |
11 | 75a51831 |
12 | 4126aa2a |
13 | 245a3679 |
14 | 1573497c |
15 | cd7be1a |
hex | 8c25742 |
146954050 has 12 divisors (see below), whose sum is σ = 273334626. Its totient is φ = 58781600.
The previous prime is 146954033. The next prime is 146954051. The reversal of 146954050 is 50459641.
It can be written as a sum of positive squares in 3 ways, for example, as 131767441 + 15186609 = 11479^2 + 3897^2 .
It is a super-2 number, since 2×1469540502 = 43190985622805000, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 146953997 and 146954015.
It is not an unprimeable number, because it can be changed into a prime (146954051) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 1469491 + ... + 1469590.
Almost surely, 2146954050 is an apocalyptic number.
146954050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
146954050 is a deficient number, since it is larger than the sum of its proper divisors (126380576).
146954050 is a wasteful number, since it uses less digits than its factorization.
146954050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2939093 (or 2939088 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 34.
The square root of 146954050 is about 12122.4605588140. The cubic root of 146954050 is about 527.7082127662.
The spelling of 146954050 in words is "one hundred forty-six million, nine hundred fifty-four thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •