Base | Representation |
---|---|
bin | 1101100100010111011… |
… | …0101100110010010011 |
3 | 211021200011011010021202 |
4 | 3121011312230302103 |
5 | 12304342122413412 |
6 | 255030150141415 |
7 | 22561304006024 |
oct | 3310566546223 |
9 | 737604133252 |
10 | 233100201107 |
11 | 8a947a94204 |
12 | 3921495186b |
13 | 18c9aa7c9a7 |
14 | b3d4176c4b |
15 | 60e43363c2 |
hex | 3645dacc93 |
233100201107 has 2 divisors, whose sum is σ = 233100201108. Its totient is φ = 233100201106.
The previous prime is 233100201071. The next prime is 233100201127. The reversal of 233100201107 is 701102001332.
Together with previous prime (233100201071) it forms an Ormiston pair, because they use the same digits, order apart.
It is an a-pointer prime, because the next prime (233100201127) can be obtained adding 233100201107 to its sum of digits (20).
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-233100201107 is a prime.
It is a super-2 number, since 2×2331002011072 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (233100201127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116550100553 + 116550100554.
It is an arithmetic number, because the mean of its divisors is an integer number (116550100554).
Almost surely, 2233100201107 is an apocalyptic number.
233100201107 is a deficient number, since it is larger than the sum of its proper divisors (1).
233100201107 is an equidigital number, since it uses as much as digits as its factorization.
233100201107 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 252, while the sum is 20.
Adding to 233100201107 its reverse (701102001332), we get a palindrome (934202202439).
The spelling of 233100201107 in words is "two hundred thirty-three billion, one hundred million, two hundred one thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •