Base | Representation |
---|---|
bin | 11011011100011… |
… | …01000001000111 |
3 | 121001012011122022 |
4 | 31232031001013 |
5 | 432413401001 |
6 | 34502153355 |
7 | 5463541643 |
oct | 1556150107 |
9 | 531164568 |
10 | 230215751 |
11 | 108a50557 |
12 | 6512285b |
13 | 3890654c |
14 | 22809c23 |
15 | 1532711b |
hex | db8d047 |
230215751 has 8 divisors (see below), whose sum is σ = 243918864. Its totient is φ = 216530560.
The previous prime is 230215747. The next prime is 230215753. The reversal of 230215751 is 157512032.
230215751 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 230215751 - 22 = 230215747 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 230215751.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230215753) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29321 + ... + 36333.
It is an arithmetic number, because the mean of its divisors is an integer number (30489858).
Almost surely, 2230215751 is an apocalyptic number.
230215751 is a deficient number, since it is larger than the sum of its proper divisors (13703113).
230215751 is a wasteful number, since it uses less digits than its factorization.
230215751 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8961.
The product of its (nonzero) digits is 2100, while the sum is 26.
The square root of 230215751 is about 15172.8623206038. The cubic root of 230215751 is about 612.8840859612.
Adding to 230215751 its reverse (157512032), we get a palindrome (387727783).
The spelling of 230215751 in words is "two hundred thirty million, two hundred fifteen thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •