Base | Representation |
---|---|
bin | 1101100100110001100… |
… | …1101000000010101101 |
3 | 211021221210210111111122 |
4 | 3121030121220002231 |
5 | 12310103231120023 |
6 | 255045112030325 |
7 | 22564106314535 |
oct | 3311431500255 |
9 | 737853714448 |
10 | 233210020013 |
11 | 8a9a3a81833 |
12 | 392456923a5 |
13 | 18cb77507a9 |
14 | b4049a24c5 |
15 | 60edcca2c8 |
hex | 364c6680ad |
233210020013 has 8 divisors (see below), whose sum is σ = 233998631328. Its totient is φ = 232421597424.
The previous prime is 233210019971. The next prime is 233210020019. The reversal of 233210020013 is 310020012332.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 233210020013 - 216 = 233209954477 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 233210019973 and 233210020000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (233210020019) 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 7 ways as a sum of consecutive naturals, for example, 2696795 + ... + 2781927.
It is an arithmetic number, because the mean of its divisors is an integer number (29249828916).
Almost surely, 2233210020013 is an apocalyptic number.
It is an amenable number.
233210020013 is a deficient number, since it is larger than the sum of its proper divisors (788611315).
233210020013 is an equidigital number, since it uses as much as digits as its factorization.
233210020013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94363.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 233210020013 its reverse (310020012332), we get a palindrome (543230032345).
The spelling of 233210020013 in words is "two hundred thirty-three billion, two hundred ten million, twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •