Base | Representation |
---|---|
bin | 11000101001100010… |
… | …01001101101001111 |
3 | 1021011020211212110020 |
4 | 30110301021231033 |
5 | 204100213043043 |
6 | 10025044113223 |
7 | 645635313003 |
oct | 142461115517 |
9 | 37136755406 |
10 | 13233331023 |
11 | 5680963510 |
12 | 2693995813 |
13 | 132b8291b3 |
14 | 8d7746703 |
15 | 526b91e83 |
hex | 314c49b4f |
13233331023 has 24 divisors (see below), whose sum is σ = 19618650240. Its totient is φ = 7868820960.
The previous prime is 13233330989. The next prime is 13233331043. The reversal of 13233331023 is 32013333231.
13233331023 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 13233331023 - 213 = 13233322831 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13233330984 and 13233331002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13233331043) 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 23 ways as a sum of consecutive naturals, for example, 21318 + ... + 164076.
It is an arithmetic number, because the mean of its divisors is an integer number (817443760).
Almost surely, 213233331023 is an apocalyptic number.
13233331023 is a deficient number, since it is larger than the sum of its proper divisors (6385319217).
13233331023 is a wasteful number, since it uses less digits than its factorization.
13233331023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142879 (or 142826 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 24.
Adding to 13233331023 its reverse (32013333231), we get a palindrome (45246664254).
The spelling of 13233331023 in words is "thirteen billion, two hundred thirty-three million, three hundred thirty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •