Base | Representation |
---|---|
bin | 1011100001101011000111… |
… | …1100001110111001011101 |
3 | 1122212112120211122020011112 |
4 | 2320122301330032321131 |
5 | 3130114042023130333 |
6 | 42541543140231405 |
7 | 2445414124050056 |
oct | 270326174167135 |
9 | 48775524566145 |
10 | 12673138880093 |
11 | 404671456754a |
12 | 150818069b565 |
13 | 70c0c1b83623 |
14 | 31b5516b372d |
15 | 16e9cdc27948 |
hex | b86b1f0ee5d |
12673138880093 has 4 divisors (see below), whose sum is σ = 12728480098140. Its totient is φ = 12617797662048.
The previous prime is 12673138880069. The next prime is 12673138880111. The reversal of 12673138880093 is 39008883137621.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 11130110337124 + 1543028542969 = 3336182^2 + 1242187^2 .
It is a cyclic number.
It is not a de Polignac number, because 12673138880093 - 210 = 12673138879069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12673138880393) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 27670608680 + ... + 27670609137.
It is an arithmetic number, because the mean of its divisors is an integer number (3182120024535).
Almost surely, 212673138880093 is an apocalyptic number.
It is an amenable number.
12673138880093 is a deficient number, since it is larger than the sum of its proper divisors (55341218047).
12673138880093 is an equidigital number, since it uses as much as digits as its factorization.
12673138880093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55341218046.
The product of its (nonzero) digits is 10450944, while the sum is 59.
The spelling of 12673138880093 in words is "twelve trillion, six hundred seventy-three billion, one hundred thirty-eight million, eight hundred eighty thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •