Base | Representation |
---|---|
bin | 1101011001100100000… |
… | …0000111111000101001 |
3 | 211000012001022110112001 |
4 | 3112121000013320221 |
5 | 12232422223304113 |
6 | 253430313251001 |
7 | 22426401345220 |
oct | 3263100077051 |
9 | 730161273461 |
10 | 230200213033 |
11 | 8969a02324a |
12 | 38745703a61 |
13 | 1892801450b |
14 | b1dad65cb7 |
15 | 5ec494a7dd |
hex | 3599007e29 |
230200213033 has 8 divisors (see below), whose sum is σ = 263588994368. Its totient is φ = 196937190864.
The previous prime is 230200213007. The next prime is 230200213039. The reversal of 230200213033 is 330312002032.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 230200213033 - 217 = 230200081961 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 230200213033.
It is not an unprimeable number, because it can be changed into a prime (230200213039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31435866 + ... + 31443187.
It is an arithmetic number, because the mean of its divisors is an integer number (32948624296).
Almost surely, 2230200213033 is an apocalyptic number.
It is an amenable number.
230200213033 is a deficient number, since it is larger than the sum of its proper divisors (33388781335).
230200213033 is an equidigital number, since it uses as much as digits as its factorization.
230200213033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62879583.
The product of its (nonzero) digits is 648, while the sum is 19.
Adding to 230200213033 its reverse (330312002032), we get a palindrome (560512215065).
The spelling of 230200213033 in words is "two hundred thirty billion, two hundred million, two hundred thirteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •