Base | Representation |
---|---|
bin | 1101100101100010000… |
… | …1001000011001011101 |
3 | 211022110222022220121210 |
4 | 3121120201020121131 |
5 | 12311012302023031 |
6 | 255121213215033 |
7 | 22602125302020 |
oct | 3313041103135 |
9 | 738428286553 |
10 | 233413314141 |
11 | 8aa98804707 |
12 | 392a1791479 |
13 | 1901a8bc287 |
14 | b4239a11b7 |
15 | 6111a85746 |
hex | 365884865d |
233413314141 has 32 divisors (see below), whose sum is σ = 356512262400. Its totient is φ = 133066354176.
The previous prime is 233413314137. The next prime is 233413314161. The reversal of 233413314141 is 141413314332.
It is not a de Polignac number, because 233413314141 - 22 = 233413314137 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 233413314099 and 233413314108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (233413314161) 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 31 ways as a sum of consecutive naturals, for example, 16668955 + ... + 16682951.
It is an arithmetic number, because the mean of its divisors is an integer number (11141008200).
Almost surely, 2233413314141 is an apocalyptic number.
233413314141 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
233413314141 is a deficient number, since it is larger than the sum of its proper divisors (123098948259).
233413314141 is a wasteful number, since it uses less digits than its factorization.
233413314141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15813.
The product of its digits is 10368, while the sum is 30.
Adding to 233413314141 its reverse (141413314332), we get a palindrome (374826628473).
The spelling of 233413314141 in words is "two hundred thirty-three billion, four hundred thirteen million, three hundred fourteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •