Base | Representation |
---|---|
bin | 1101011000110100010… |
… | …0110000011100001101 |
3 | 210222200002202201121012 |
4 | 3112031010300130031 |
5 | 12232020011214013 |
6 | 253354404215005 |
7 | 22421421413465 |
oct | 3261504603415 |
9 | 728602681535 |
10 | 230000101133 |
11 | 895a7074210 |
12 | 386aa69a465 |
13 | 188c571b2ca |
14 | b1bc554ba5 |
15 | 5eb20bd1a8 |
hex | 358d13070d |
230000101133 has 8 divisors (see below), whose sum is σ = 251314554720. Its totient is φ = 208753206480.
The previous prime is 230000101127. The next prime is 230000101181. The reversal of 230000101133 is 331101000032.
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 230000101133 - 230 = 228926359309 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230000101103) 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, 16882610 + ... + 16896227.
It is an arithmetic number, because the mean of its divisors is an integer number (31414319340).
Almost surely, 2230000101133 is an apocalyptic number.
It is an amenable number.
230000101133 is a deficient number, since it is larger than the sum of its proper divisors (21314453587).
230000101133 is a wasteful number, since it uses less digits than its factorization.
230000101133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33779467.
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 230000101133 its reverse (331101000032), we get a palindrome (561101101165).
It can be divided in two parts, 230000 and 101133, that added together give a palindrome (331133).
The spelling of 230000101133 in words is "two hundred thirty billion, one hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •