Base | Representation |
---|---|
bin | 1101100100011100111… |
… | …1010010001110000011 |
3 | 211021201202211220212211 |
4 | 3121013033102032003 |
5 | 12304414044014412 |
6 | 255032340002551 |
7 | 22562005254451 |
oct | 3310717221603 |
9 | 737652756784 |
10 | 233123423107 |
11 | 8a95a105243 |
12 | 39220690457 |
13 | 18ca2820813 |
14 | b3d729d9d1 |
15 | 60e63c1ca7 |
hex | 36473d2383 |
233123423107 has 2 divisors, whose sum is σ = 233123423108. Its totient is φ = 233123423106.
The previous prime is 233123423041. The next prime is 233123423147. The reversal of 233123423107 is 701324321332.
233123423107 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-233123423107 is a prime.
It is a super-2 number, since 2×2331234231072 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (233123423147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116561711553 + 116561711554.
It is an arithmetic number, because the mean of its divisors is an integer number (116561711554).
Almost surely, 2233123423107 is an apocalyptic number.
233123423107 is a deficient number, since it is larger than the sum of its proper divisors (1).
233123423107 is an equidigital number, since it uses as much as digits as its factorization.
233123423107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18144, while the sum is 31.
Adding to 233123423107 its reverse (701324321332), we get a palindrome (934447744439).
The spelling of 233123423107 in words is "two hundred thirty-three billion, one hundred twenty-three million, four hundred twenty-three thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •