Base | Representation |
---|---|
bin | 1101011001001111100… |
… | …0000101100011010011 |
3 | 210222222001111120120220 |
4 | 3112103320011203103 |
5 | 12232233220021433 |
6 | 253414002204123 |
7 | 22424305412325 |
oct | 3262370054323 |
9 | 728861446526 |
10 | 230114220243 |
11 | 89655529626 |
12 | 38720953643 |
13 | 189132664cb |
14 | b1cd77d615 |
15 | 5ebc1112b3 |
hex | 3593e058d3 |
230114220243 has 8 divisors (see below), whose sum is σ = 306858382800. Its totient is φ = 153389768928.
The previous prime is 230114220241. The next prime is 230114220263. The reversal of 230114220243 is 342022411032.
It is a happy number.
230114220243 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 not a de Polignac number, because 230114220243 - 21 = 230114220241 is a prime.
It is not an unprimeable number, because it can be changed into a prime (230114220241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4900548 + ... + 4947281.
It is an arithmetic number, because the mean of its divisors is an integer number (38357297850).
Almost surely, 2230114220243 is an apocalyptic number.
230114220243 is a deficient number, since it is larger than the sum of its proper divisors (76744162557).
230114220243 is an equidigital number, since it uses as much as digits as its factorization.
230114220243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9855621.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 230114220243 its reverse (342022411032), we get a palindrome (572136631275).
The spelling of 230114220243 in words is "two hundred thirty billion, one hundred fourteen million, two hundred twenty thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •