Base | Representation |
---|---|
bin | 10001011010110… |
… | …10010001101001 |
3 | 101011221202110202 |
4 | 20231122101221 |
5 | 244401344313 |
6 | 22255521545 |
7 | 3423005114 |
oct | 1055322151 |
9 | 334852422 |
10 | 146121833 |
11 | 75533550 |
12 | 40b292b5 |
13 | 24371930 |
14 | 1559957b |
15 | cc65558 |
hex | 8b5a469 |
146121833 has 8 divisors (see below), whose sum is σ = 171667776. Its totient is φ = 122619600.
The previous prime is 146121823. The next prime is 146121847. The reversal of 146121833 is 338121641.
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 146121833 - 210 = 146120809 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 146121796 and 146121805.
It is not an unprimeable number, because it can be changed into a prime (146121823) 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 7 ways as a sum of consecutive naturals, for example, 510773 + ... + 511058.
It is an arithmetic number, because the mean of its divisors is an integer number (21458472).
Almost surely, 2146121833 is an apocalyptic number.
146121833 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
146121833 is a deficient number, since it is larger than the sum of its proper divisors (25545943).
146121833 is a wasteful number, since it uses less digits than its factorization.
146121833 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1021855.
The product of its digits is 3456, while the sum is 29.
The square root of 146121833 is about 12088.0864076991. The cubic root of 146121833 is about 526.7101697673.
The spelling of 146121833 in words is "one hundred forty-six million, one hundred twenty-one thousand, eight hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •