Base | Representation |
---|---|
bin | 11000001111010010… |
… | …11010110110010001 |
3 | 1020120220122001211111 |
4 | 30013221122312101 |
5 | 203122334402043 |
6 | 5551142013321 |
7 | 640323243253 |
oct | 140751326621 |
9 | 36526561744 |
10 | 13013200273 |
11 | 5578680a77 |
12 | 2632117241 |
13 | 12c5044108 |
14 | 8b6403cd3 |
15 | 5126ad09d |
hex | 307a5ad91 |
13013200273 has 8 divisors (see below), whose sum is σ = 13814110440. Its totient is φ = 12216226560.
The previous prime is 13013200261. The next prime is 13013200279. The reversal of 13013200273 is 37200231031.
It is a happy number.
13013200273 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 4878603409 + 8134596864 = 69847^2 + 90192^2 .
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 13013200273 - 229 = 12476329361 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13013200279) 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, 977298 + ... + 990523.
It is an arithmetic number, because the mean of its divisors is an integer number (1726763805).
Almost surely, 213013200273 is an apocalyptic number.
It is an amenable number.
13013200273 is a deficient number, since it is larger than the sum of its proper divisors (800910167).
13013200273 is a wasteful number, since it uses less digits than its factorization.
13013200273 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1968227.
The product of its (nonzero) digits is 756, while the sum is 22.
The spelling of 13013200273 in words is "thirteen billion, thirteen million, two hundred thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •