Base | Representation |
---|---|
bin | 11000101001011111… |
… | …11011010101100101 |
3 | 1021011020020120010021 |
4 | 30110233323111211 |
5 | 204100122310041 |
6 | 10025033155141 |
7 | 645632505100 |
oct | 142457732545 |
9 | 37136216107 |
10 | 13233010021 |
11 | 5680764320 |
12 | 269385bab1 |
13 | 132b74605a |
14 | 8d76a1737 |
15 | 526b2bcd1 |
hex | 314bfb565 |
13233010021 has 24 divisors (see below), whose sum is σ = 17334639360. Its totient is φ = 9978796800.
The previous prime is 13233009997. The next prime is 13233010057. The reversal of 13233010021 is 12001033231.
It is not a de Polignac number, because 13233010021 - 29 = 13233009509 is a prime.
It is a super-2 number, since 2×132330100212 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13233009977 and 13233010004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13233010321) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 379276 + ... + 412693.
It is an arithmetic number, because the mean of its divisors is an integer number (722276640).
Almost surely, 213233010021 is an apocalyptic number.
13233010021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13233010021 is a deficient number, since it is larger than the sum of its proper divisors (4101629339).
13233010021 is a wasteful number, since it uses less digits than its factorization.
13233010021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 792025 (or 792018 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 13233010021 its reverse (12001033231), we get a palindrome (25234043252).
The spelling of 13233010021 in words is "thirteen billion, two hundred thirty-three million, ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •