Base | Representation |
---|---|
bin | 11000010110011100… |
… | …01110101010010101 |
3 | 1020202002111102101020 |
4 | 30023032032222111 |
5 | 203233213300313 |
6 | 10001123351353 |
7 | 641652131202 |
oct | 141316165225 |
9 | 36662442336 |
10 | 13073181333 |
11 | 55a95196a3 |
12 | 264a222559 |
13 | 13045b5574 |
14 | 8c0378ca9 |
15 | 517aaa323 |
hex | 30b38ea95 |
13073181333 has 8 divisors (see below), whose sum is σ = 17431440000. Its totient is φ = 8715188448.
The previous prime is 13073181269. The next prime is 13073181361. The reversal of 13073181333 is 33318137031.
13073181333 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13073181333 - 26 = 13073181269 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13073181294 and 13073181303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13073101333) 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, 139668 + ... + 213666.
It is an arithmetic number, because the mean of its divisors is an integer number (2178930000).
Almost surely, 213073181333 is an apocalyptic number.
It is an amenable number.
13073181333 is a deficient number, since it is larger than the sum of its proper divisors (4358258667).
13073181333 is an equidigital number, since it uses as much as digits as its factorization.
13073181333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132891.
The product of its (nonzero) digits is 13608, while the sum is 33.
The spelling of 13073181333 in words is "thirteen billion, seventy-three million, one hundred eighty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •