Base | Representation |
---|---|
bin | 1101011001010011111… |
… | …1101110111110010101 |
3 | 211000000100211210111110 |
4 | 3112110333232332111 |
5 | 12232303022032013 |
6 | 253415512525233 |
7 | 22424624146116 |
oct | 3262477567625 |
9 | 730010753443 |
10 | 230133002133 |
11 | 89665097751 |
12 | 387270b0819 |
13 | 18917111358 |
14 | b1d206c20d |
15 | 5ebdac12c3 |
hex | 3594feef95 |
230133002133 has 4 divisors (see below), whose sum is σ = 306844002848. Its totient is φ = 153422001420.
The previous prime is 230133002093. The next prime is 230133002179. The reversal of 230133002133 is 331200331032.
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 not a de Polignac number, because 230133002133 - 217 = 230132871061 is a prime.
It is a super-2 number, since 2×2301330021332 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230133007133) 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, 38355500353 + ... + 38355500358.
It is an arithmetic number, because the mean of its divisors is an integer number (76711000712).
Almost surely, 2230133002133 is an apocalyptic number.
It is an amenable number.
230133002133 is a deficient number, since it is larger than the sum of its proper divisors (76711000715).
230133002133 is an equidigital number, since it uses as much as digits as its factorization.
230133002133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76711000714.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 230133002133 its reverse (331200331032), we get a palindrome (561333333165).
The spelling of 230133002133 in words is "two hundred thirty billion, one hundred thirty-three million, two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •