Base | Representation |
---|---|
bin | 1101011001100100010… |
… | …0111001110101111001 |
3 | 211000012010200010120212 |
4 | 3112121010321311321 |
5 | 12232423033404413 |
6 | 253430400200505 |
7 | 22426415114654 |
oct | 3263104716571 |
9 | 730163603525 |
10 | 230201466233 |
11 | 8969a7a9852 |
12 | 38746009135 |
13 | 18928362a5b |
14 | b1db1b089b |
15 | 5ec4ae6ca8 |
hex | 3599139d79 |
230201466233 has 4 divisors (see below), whose sum is σ = 230216599440. Its totient is φ = 230186333028.
The previous prime is 230201466227. The next prime is 230201466241. The reversal of 230201466233 is 332664102032.
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 a de Polignac number, because none of the positive numbers 2k-230201466233 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 230201466233.
It is not an unprimeable number, because it can be changed into a prime (230201466533) 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, 7543763 + ... + 7574216.
It is an arithmetic number, because the mean of its divisors is an integer number (57554149860).
Almost surely, 2230201466233 is an apocalyptic number.
It is an amenable number.
230201466233 is a deficient number, since it is larger than the sum of its proper divisors (15133207).
230201466233 is a wasteful number, since it uses less digits than its factorization.
230201466233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15133206.
The product of its (nonzero) digits is 31104, while the sum is 32.
Adding to 230201466233 its reverse (332664102032), we get a palindrome (562865568265).
The spelling of 230201466233 in words is "two hundred thirty billion, two hundred one million, four hundred sixty-six thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •