Base | Representation |
---|---|
bin | 11011011101001… |
… | …00000101001101 |
3 | 121001100222020012 |
4 | 31232210011031 |
5 | 432424411341 |
6 | 34504203005 |
7 | 5464414241 |
oct | 1556440515 |
9 | 531328205 |
10 | 230310221 |
11 | 109005529 |
12 | 65169465 |
13 | 3893a54b |
14 | 22832421 |
15 | 153450eb |
hex | dba414d |
230310221 has 2 divisors, whose sum is σ = 230310222. Its totient is φ = 230310220.
The previous prime is 230310187. The next prime is 230310239. The reversal of 230310221 is 122013032.
It is a happy number.
230310221 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 129709321 + 100600900 = 11389^2 + 10030^2 .
It is a cyclic number.
It is not a de Polignac number, because 230310221 - 210 = 230309197 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 230310196 and 230310205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (230310121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115155110 + 115155111.
It is an arithmetic number, because the mean of its divisors is an integer number (115155111).
Almost surely, 2230310221 is an apocalyptic number.
It is an amenable number.
230310221 is a deficient number, since it is larger than the sum of its proper divisors (1).
230310221 is an equidigital number, since it uses as much as digits as its factorization.
230310221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 14.
The square root of 230310221 is about 15175.9751251773. The cubic root of 230310221 is about 612.9679076827.
Adding to 230310221 its reverse (122013032), we get a palindrome (352323253).
The spelling of 230310221 in words is "two hundred thirty million, three hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •