Base | Representation |
---|---|
bin | 1101011001001111010… |
… | …0001111101011001101 |
3 | 210222221222121102002112 |
4 | 3112103310033223031 |
5 | 12232232440310013 |
6 | 253413524433405 |
7 | 22424264016206 |
oct | 3262364175315 |
9 | 728858542075 |
10 | 230113213133 |
11 | 89654a00a01 |
12 | 38720548865 |
13 | 18912ca2c9b |
14 | b1cd59a5ad |
15 | 5ebbeb2ba8 |
hex | 3593d0facd |
230113213133 has 4 divisors (see below), whose sum is σ = 232885661568. Its totient is φ = 227340764700.
The previous prime is 230113213097. The next prime is 230113213189. The reversal of 230113213133 is 331312311032.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 230113213133 - 212 = 230113209037 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 230113213099 and 230113213108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230113213333) 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, 1386224093 + ... + 1386224258.
It is an arithmetic number, because the mean of its divisors is an integer number (58221415392).
Almost surely, 2230113213133 is an apocalyptic number.
It is an amenable number.
230113213133 is a deficient number, since it is larger than the sum of its proper divisors (2772448435).
230113213133 is an equidigital number, since it uses as much as digits as its factorization.
230113213133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2772448434.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 230113213133 its reverse (331312311032), we get a palindrome (561425524165).
The spelling of 230113213133 in words is "two hundred thirty billion, one hundred thirteen million, two hundred thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •