Base | Representation |
---|---|
bin | 1101100101001001011… |
… | …1011100100100001101 |
3 | 211022012210010200220202 |
4 | 3121102113130210031 |
5 | 12310304342041023 |
6 | 255103045223245 |
7 | 22566433142126 |
oct | 3312227344415 |
9 | 738183120822 |
10 | 233310112013 |
11 | 8aa455263a0 |
12 | 39273101b25 |
13 | 190023c7124 |
14 | b413db904d |
15 | 610799c128 |
hex | 36525dc90d |
233310112013 has 16 divisors (see below), whose sum is σ = 257474972160. Its totient is φ = 209651924400.
The previous prime is 233310111949. The next prime is 233310112027. The reversal of 233310112013 is 310211013332.
233310112013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 233310112013 - 26 = 233310111949 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (233310112313) 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 15 ways as a sum of consecutive naturals, for example, 25943 + ... + 683588.
It is an arithmetic number, because the mean of its divisors is an integer number (16092185760).
Almost surely, 2233310112013 is an apocalyptic number.
It is an amenable number.
233310112013 is a deficient number, since it is larger than the sum of its proper divisors (24164860147).
233310112013 is a wasteful number, since it uses less digits than its factorization.
233310112013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 709888.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 233310112013 its reverse (310211013332), we get a palindrome (543521125345).
The spelling of 233310112013 in words is "two hundred thirty-three billion, three hundred ten million, one hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •