Base | Representation |
---|---|
bin | 1101100100000101000… |
… | …0111110001011011101 |
3 | 211021110210021011101110 |
4 | 3121001100332023131 |
5 | 12304212414431023 |
6 | 255014355532233 |
7 | 22556350351620 |
oct | 3310120761335 |
9 | 737423234343 |
10 | 233023202013 |
11 | 8a908582698 |
12 | 391b2bba079 |
13 | 18c87b304b4 |
14 | b3c7c51db7 |
15 | 60dc6c6a93 |
hex | 364143e2dd |
233023202013 has 16 divisors (see below), whose sum is σ = 360382722560. Its totient is φ = 131168709936.
The previous prime is 233023201997. The next prime is 233023202021. The reversal of 233023202013 is 310202320332.
233023202013 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 233023202013 - 24 = 233023201997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (233023202063) 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, 82807123 + ... + 82809936.
It is an arithmetic number, because the mean of its divisors is an integer number (22523920160).
Almost surely, 2233023202013 is an apocalyptic number.
It is an amenable number.
233023202013 is a deficient number, since it is larger than the sum of its proper divisors (127359520547).
233023202013 is a wasteful number, since it uses less digits than its factorization.
233023202013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165617136.
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 233023202013 its reverse (310202320332), we get a palindrome (543225522345).
The spelling of 233023202013 in words is "two hundred thirty-three billion, twenty-three million, two hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •