Base | Representation |
---|---|
bin | 1101011001101000110… |
… | …1101000010110110111 |
3 | 211000020110112201201001 |
4 | 3112122031220112313 |
5 | 12232442423444002 |
6 | 253432320544131 |
7 | 22430036140516 |
oct | 3263215502667 |
9 | 730213481631 |
10 | 230220531127 |
11 | 896aa540564 |
12 | 38750482047 |
13 | 1892c2a9662 |
14 | b1dd93467d |
15 | 5ec6610a87 |
hex | 359a3685b7 |
230220531127 has 4 divisors (see below), whose sum is σ = 231051652456. Its totient is φ = 229389409800.
The previous prime is 230220531091. The next prime is 230220531133. The reversal of 230220531127 is 721135022032.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 230220531127 - 27 = 230220530999 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 230220531095 and 230220531104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230220531227) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 415560249 + ... + 415560802.
It is an arithmetic number, because the mean of its divisors is an integer number (57762913114).
Almost surely, 2230220531127 is an apocalyptic number.
230220531127 is a deficient number, since it is larger than the sum of its proper divisors (831121329).
230220531127 is an equidigital number, since it uses as much as digits as its factorization.
230220531127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 831121328.
The product of its (nonzero) digits is 5040, while the sum is 28.
Adding to 230220531127 its reverse (721135022032), we get a palindrome (951355553159).
It can be divided in two parts, 2302205 and 31127, that added together give a palindrome (2333332).
The spelling of 230220531127 in words is "two hundred thirty billion, two hundred twenty million, five hundred thirty-one thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •