Base | Representation |
---|---|
bin | 1101011001100110011… |
… | …0101001110011011001 |
3 | 211000012202022121122221 |
4 | 3112121212221303121 |
5 | 12232432320012213 |
6 | 253431313544041 |
7 | 22426553243362 |
oct | 3263146516331 |
9 | 730182277587 |
10 | 230210313433 |
11 | 896a47a1891 |
12 | 38748b75021 |
13 | 1892a13c999 |
14 | b1dc434b69 |
15 | 5ec579338d |
hex | 35999a9cd9 |
230210313433 has 4 divisors (see below), whose sum is σ = 237636452608. Its totient is φ = 222784174260.
The previous prime is 230210313383. The next prime is 230210313439. The reversal of 230210313433 is 334313012032.
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 230210313433 - 221 = 230208216281 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 230210313398 and 230210313407.
It is not an unprimeable number, because it can be changed into a prime (230210313439) 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, 3713069541 + ... + 3713069602.
It is an arithmetic number, because the mean of its divisors is an integer number (59409113152).
Almost surely, 2230210313433 is an apocalyptic number.
It is an amenable number.
230210313433 is a deficient number, since it is larger than the sum of its proper divisors (7426139175).
230210313433 is an equidigital number, since it uses as much as digits as its factorization.
230210313433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7426139174.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 230210313433 its reverse (334313012032), we get a palindrome (564523325465).
The spelling of 230210313433 in words is "two hundred thirty billion, two hundred ten million, three hundred thirteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.264 sec. • engine limits •