Base | Representation |
---|---|
bin | 1101100100011100001… |
… | …0100111011011010101 |
3 | 211021201112121012022121 |
4 | 3121013002213123111 |
5 | 12304412221231401 |
6 | 255032140455541 |
7 | 22561635113305 |
oct | 3310702473325 |
9 | 737645535277 |
10 | 233120102101 |
11 | 8a958247107 |
12 | 3921b54a5b1 |
13 | 18ca1c2a023 |
14 | b3d6a77605 |
15 | 60e5e67ca1 |
hex | 36470a76d5 |
233120102101 has 4 divisors (see below), whose sum is σ = 235298794752. Its totient is φ = 230941409452.
The previous prime is 233120102069. The next prime is 233120102153. The reversal of 233120102101 is 101201021332.
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 233120102101 - 25 = 233120102069 is a prime.
It is a super-2 number, since 2×2331201021012 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (233120162101) 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, 1089346165 + ... + 1089346378.
It is an arithmetic number, because the mean of its divisors is an integer number (58824698688).
Almost surely, 2233120102101 is an apocalyptic number.
It is an amenable number.
233120102101 is a deficient number, since it is larger than the sum of its proper divisors (2178692651).
233120102101 is a wasteful number, since it uses less digits than its factorization.
233120102101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2178692650.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 233120102101 its reverse (101201021332), we get a palindrome (334321123433).
The spelling of 233120102101 in words is "two hundred thirty-three billion, one hundred twenty million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •