Base | Representation |
---|---|
bin | 10001011010111… |
… | …00000010100010 |
3 | 101011222010101100 |
4 | 20231130002202 |
5 | 244402112213 |
6 | 22300015230 |
7 | 3423035145 |
oct | 1055340242 |
9 | 334863340 |
10 | 146129058 |
11 | 75538a19 |
12 | 40b31516 |
13 | 24374cca |
14 | 1559c05c |
15 | cc67773 |
hex | 8b5c0a2 |
146129058 has 48 divisors (see below), whose sum is σ = 326674296. Its totient is φ = 47174400.
The previous prime is 146129047. The next prime is 146129101. The reversal of 146129058 is 850921641.
It can be written as a sum of positive squares in 4 ways, for example, as 132089049 + 14040009 = 11493^2 + 3747^2 .
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, 208108 + ... + 208808.
Almost surely, 2146129058 is an apocalyptic number.
146129058 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 146129058, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (163337148).
146129058 is an abundant number, since it is smaller than the sum of its proper divisors (180545238).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146129058 is a wasteful number, since it uses less digits than its factorization.
146129058 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1059 (or 1056 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 36.
The square root of 146129058 is about 12088.3852519681. The cubic root of 146129058 is about 526.7188506928.
The spelling of 146129058 in words is "one hundred forty-six million, one hundred twenty-nine thousand, fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •