Base | Representation |
---|---|
bin | 1100001101111010111101… |
… | …1001011101001000100001 |
3 | 1202120012201011002112220021 |
4 | 3003132233121131020201 |
5 | 3230042402141422241 |
6 | 44323101511313441 |
7 | 2554344555040243 |
oct | 303365731351041 |
9 | 52505634075807 |
10 | 13433305420321 |
11 | 430a03a782356 |
12 | 160b56a97b881 |
13 | 7659a841b057 |
14 | 346265620093 |
15 | 18466ee7d0d1 |
hex | c37af65d221 |
13433305420321 has 8 divisors (see below), whose sum is σ = 13760567938944. Its totient is φ = 13107769881360.
The previous prime is 13433305420319. The next prime is 13433305420363. The reversal of 13433305420321 is 12302450333431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13433305420321 - 21 = 13433305420319 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13433305420021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 431729170 + ... + 431760283.
It is an arithmetic number, because the mean of its divisors is an integer number (1720070992368).
Almost surely, 213433305420321 is an apocalyptic number.
It is an amenable number.
13433305420321 is a deficient number, since it is larger than the sum of its proper divisors (327262518623).
13433305420321 is an equidigital number, since it uses as much as digits as its factorization.
13433305420321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 863489831.
The product of its (nonzero) digits is 77760, while the sum is 34.
Adding to 13433305420321 its reverse (12302450333431), we get a palindrome (25735755753752).
The spelling of 13433305420321 in words is "thirteen trillion, four hundred thirty-three billion, three hundred five million, four hundred twenty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •