Base | Representation |
---|---|
bin | 1000101011111111… |
… | …1011001001001101 |
3 | 20000112002112121210 |
4 | 2022333323021031 |
5 | 14233443410013 |
6 | 1023223045033 |
7 | 111534533052 |
oct | 21277731115 |
9 | 6015075553 |
10 | 2332013133 |
11 | a973a6a8a |
12 | 550ba0779 |
13 | 2b21a3538 |
14 | 181a03029 |
15 | d9ae6cc3 |
hex | 8affb24d |
2332013133 has 4 divisors (see below), whose sum is σ = 3109350848. Its totient is φ = 1554675420.
The previous prime is 2332013119. The next prime is 2332013143. The reversal of 2332013133 is 3313102332.
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 not a de Polignac number, because 2332013133 - 212 = 2332009037 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 (2332013113) 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 3 ways as a sum of consecutive naturals, for example, 388668853 + ... + 388668858.
It is an arithmetic number, because the mean of its divisors is an integer number (777337712).
Almost surely, 22332013133 is an apocalyptic number.
It is an amenable number.
2332013133 is a deficient number, since it is larger than the sum of its proper divisors (777337715).
2332013133 is an equidigital number, since it uses as much as digits as its factorization.
2332013133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 777337714.
The product of its (nonzero) digits is 972, while the sum is 21.
The square root of 2332013133 is about 48290.9218487285. The cubic root of 2332013133 is about 1326.1022053127.
Adding to 2332013133 its reverse (3313102332), we get a palindrome (5645115465).
The spelling of 2332013133 in words is "two billion, three hundred thirty-two million, thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •