Base | Representation |
---|---|
bin | 11000010000011110… |
… | …01110010001001101 |
3 | 1020121121021112201121 |
4 | 30020033032101031 |
5 | 203132404011341 |
6 | 5552134240541 |
7 | 640503416242 |
oct | 141017162115 |
9 | 36547245647 |
10 | 13023110221 |
11 | 558322a510 |
12 | 26354b6151 |
13 | 12c71039a4 |
14 | 8b78635c9 |
15 | 5134b94d1 |
hex | 3083ce44d |
13023110221 has 8 divisors (see below), whose sum is σ = 14210106624. Its totient is φ = 11836626720.
The previous prime is 13023110201. The next prime is 13023110227. The reversal of 13023110221 is 12201132031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13023110221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13023110195 and 13023110204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13023110227) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 74136 + ... + 177601.
It is an arithmetic number, because the mean of its divisors is an integer number (1776263328).
Almost surely, 213023110221 is an apocalyptic number.
13023110221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13023110221 is a deficient number, since it is larger than the sum of its proper divisors (1186996403).
13023110221 is a wasteful number, since it uses less digits than its factorization.
13023110221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 256451.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 13023110221 its reverse (12201132031), we get a palindrome (25224242252).
The spelling of 13023110221 in words is "thirteen billion, twenty-three million, one hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •