Base | Representation |
---|---|
bin | 1100000001101011100011… |
… | …0100100110010101001001 |
3 | 1201211002220022102002122221 |
4 | 3000122320310212111021 |
5 | 3213121211043231241 |
6 | 44042322245414041 |
7 | 2533221342431242 |
oct | 300327064462511 |
9 | 51732808362587 |
10 | 13223010133321 |
11 | 42389355516aa |
12 | 159685b40a321 |
13 | 74bc031a3ba1 |
14 | 339dd60b1cc9 |
15 | 17de62c6d5d1 |
hex | c06b8d26549 |
13223010133321 has 8 divisors (see below), whose sum is σ = 13447200644640. Its totient is φ = 12998822011968.
The previous prime is 13223010133297. The next prime is 13223010133339. The reversal of 13223010133321 is 12333101032231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13223010133321 - 233 = 13214420198729 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13223010133351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13265265 + ... + 14227201.
It is an arithmetic number, because the mean of its divisors is an integer number (1680900080580).
Almost surely, 213223010133321 is an apocalyptic number.
It is an amenable number.
13223010133321 is a deficient number, since it is larger than the sum of its proper divisors (224190511319).
13223010133321 is an equidigital number, since it uses as much as digits as its factorization.
13223010133321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1194983.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 13223010133321 its reverse (12333101032231), we get a palindrome (25556111165552).
The spelling of 13223010133321 in words is "thirteen trillion, two hundred twenty-three billion, ten million, one hundred thirty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •