Base | Representation |
---|---|
bin | 1101100100011110110… |
… | …1000010010001010111 |
3 | 211021202022112011002112 |
4 | 3121013231002101113 |
5 | 12304423043101403 |
6 | 255033215101235 |
7 | 22562131456163 |
oct | 3310755022127 |
9 | 737668464075 |
10 | 233131222103 |
11 | 8a96355179a |
12 | 3922321181b |
13 | 18ca4321600 |
14 | b3d832dca3 |
15 | 60e6e129d8 |
hex | 3647b42457 |
233131222103 has 12 divisors (see below), whose sum is σ = 253555996968. Its totient is φ = 214250006880.
The previous prime is 233131222091. The next prime is 233131222109. The reversal of 233131222103 is 301222131332.
233131222103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 233131222103 - 214 = 233131205719 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 (233131222109) 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 in 11 ways as a sum of consecutive naturals, for example, 3000128 + ... + 3076853.
It is an arithmetic number, because the mean of its divisors is an integer number (21129666414).
Almost surely, 2233131222103 is an apocalyptic number.
233131222103 is a deficient number, since it is larger than the sum of its proper divisors (20424774865).
233131222103 is a wasteful number, since it uses less digits than its factorization.
233131222103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6077234 (or 6077221 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 233131222103 its reverse (301222131332), we get a palindrome (534353353435).
The spelling of 233131222103 in words is "two hundred thirty-three billion, one hundred thirty-one million, two hundred twenty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •