Base | Representation |
---|---|
bin | 1011111010110001011110… |
… | …1111000101111111111011 |
3 | 1201101202121020002120000022 |
4 | 2332230113233011333323 |
5 | 3204200143410111103 |
6 | 43512015142401055 |
7 | 2521520563253354 |
oct | 276542757057773 |
9 | 51352536076008 |
10 | 13104343441403 |
11 | 41a2580274695 |
12 | 157786213018b |
13 | 7409712b7416 |
14 | 334379c7ad2b |
15 | 17ad19d87138 |
hex | beb17bc5ffb |
13104343441403 has 4 divisors (see below), whose sum is σ = 13104999564288. Its totient is φ = 13103687318520.
The previous prime is 13104343441369. The next prime is 13104343441457. The reversal of 13104343441403 is 30414434340131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13104343441403 - 212 = 13104343437307 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13104343441003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 328031483 + ... + 328071428.
It is an arithmetic number, because the mean of its divisors is an integer number (3276249891072).
Almost surely, 213104343441403 is an apocalyptic number.
13104343441403 is a deficient number, since it is larger than the sum of its proper divisors (656122885).
13104343441403 is an equidigital number, since it uses as much as digits as its factorization.
13104343441403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 656122884.
The product of its (nonzero) digits is 82944, while the sum is 35.
Adding to 13104343441403 its reverse (30414434340131), we get a palindrome (43518777781534).
The spelling of 13104343441403 in words is "thirteen trillion, one hundred four billion, three hundred forty-three million, four hundred forty-one thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •