Base | Representation |
---|---|
bin | 10001011001111… |
… | …10000101010001 |
3 | 101011201220001201 |
4 | 20230332011101 |
5 | 244334200403 |
6 | 22253231201 |
7 | 3422014333 |
oct | 1054760521 |
9 | 334656051 |
10 | 146006353 |
11 | 75464809 |
12 | 40a92501 |
13 | 243311bc |
14 | 15569453 |
15 | cc4121d |
hex | 8b3e151 |
146006353 has 8 divisors (see below), whose sum is σ = 155383272. Its totient is φ = 136717056.
The previous prime is 146006347. The next prime is 146006479. The reversal of 146006353 is 353600641.
It can be written as a sum of positive squares in 4 ways, for example, as 35188624 + 110817729 = 5932^2 + 10527^2 .
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 146006353 - 29 = 146005841 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (146006953) 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, 18450 + ... + 25147.
It is an arithmetic number, because the mean of its divisors is an integer number (19422909).
Almost surely, 2146006353 is an apocalyptic number.
It is an amenable number.
146006353 is a deficient number, since it is larger than the sum of its proper divisors (9376919).
146006353 is a wasteful number, since it uses less digits than its factorization.
146006353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43811.
The product of its (nonzero) digits is 6480, while the sum is 28.
The square root of 146006353 is about 12083.3088597453. The cubic root of 146006353 is about 526.5713802850.
Adding to 146006353 its reverse (353600641), we get a palindrome (499606994).
The spelling of 146006353 in words is "one hundred forty-six million, six thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •