Base | Representation |
---|---|
bin | 1011111011110011101001… |
… | …0010110111010100101001 |
3 | 1201110110102221001100110001 |
4 | 2332330322102313110221 |
5 | 3204443031344104001 |
6 | 43524113322023001 |
7 | 2523016643054521 |
oct | 276747222672451 |
9 | 51413387040401 |
10 | 13122103113001 |
11 | 41aa064129833 |
12 | 157b199947a61 |
13 | 7425417b053c |
14 | 3351827c8681 |
15 | 17b5090bc001 |
hex | bef3a4b7529 |
13122103113001 has 8 divisors (see below), whose sum is σ = 13346256708000. Its totient is φ = 12898007687040.
The previous prime is 13122103112983. The next prime is 13122103113013. The reversal of 13122103113001 is 10031130122131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13122103113001 - 211 = 13122103110953 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13122103113001.
It is not an unprimeable number, because it can be changed into a prime (13122103113071) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14087115 + ... + 14989696.
It is an arithmetic number, because the mean of its divisors is an integer number (1668282088500).
Almost surely, 213122103113001 is an apocalyptic number.
It is an amenable number.
13122103113001 is a deficient number, since it is larger than the sum of its proper divisors (224153594999).
13122103113001 is an equidigital number, since it uses as much as digits as its factorization.
13122103113001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29084519.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 13122103113001 its reverse (10031130122131), we get a palindrome (23153233235132).
The spelling of 13122103113001 in words is "thirteen trillion, one hundred twenty-two billion, one hundred three million, one hundred thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •