Base | Representation |
---|---|
bin | 11011011011100… |
… | …10000100001001 |
3 | 121000222120012111 |
4 | 31231302010021 |
5 | 432401332403 |
6 | 34455542321 |
7 | 5462602042 |
oct | 1555620411 |
9 | 530876174 |
10 | 230105353 |
11 | 108985615 |
12 | 6508a9a1 |
13 | 3889821a |
14 | 227bb8c9 |
15 | 1530456d |
hex | db72109 |
230105353 has 8 divisors (see below), whose sum is σ = 244001160. Its totient is φ = 216249600.
The previous prime is 230105339. The next prime is 230105389. The reversal of 230105353 is 353501032.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 60793209 + 169312144 = 7797^2 + 13012^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 230105353 - 29 = 230104841 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (230105303) 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, 2263 + ... + 21571.
It is an arithmetic number, because the mean of its divisors is an integer number (30500145).
Almost surely, 2230105353 is an apocalyptic number.
It is an amenable number.
230105353 is a deficient number, since it is larger than the sum of its proper divisors (13895807).
230105353 is a wasteful number, since it uses less digits than its factorization.
230105353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20027.
The product of its (nonzero) digits is 1350, while the sum is 22.
The square root of 230105353 is about 15169.2238759931. The cubic root of 230105353 is about 612.7861025183.
Adding to 230105353 its reverse (353501032), we get a palindrome (583606385).
The spelling of 230105353 in words is "two hundred thirty million, one hundred five thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •