Base | Representation |
---|---|
bin | 1100000111011000111110… |
… | …0011111010011001001001 |
3 | 1202011111002111211101111102 |
4 | 3001312033203322121021 |
5 | 3221223104122003001 |
6 | 44155344013511145 |
7 | 2543263220642024 |
oct | 301661743723111 |
9 | 52144074741442 |
10 | 13321102141001 |
11 | 42764a1972946 |
12 | 15b18761a24b5 |
13 | 758236611c95 |
14 | 340a5d9881bb |
15 | 1817a471be6b |
hex | c1d8f8fa649 |
13321102141001 has 8 divisors (see below), whose sum is σ = 13347010351200. Its totient is φ = 13295195602272.
The previous prime is 13321102140977. The next prime is 13321102141037. The reversal of 13321102141001 is 10014120112331.
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 13321102141001 - 222 = 13321097946697 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13321102141051) 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, 16176821 + ... + 16980333.
It is an arithmetic number, because the mean of its divisors is an integer number (1668376293900).
Almost surely, 213321102141001 is an apocalyptic number.
It is an amenable number.
13321102141001 is a deficient number, since it is larger than the sum of its proper divisors (25908210199).
13321102141001 is an equidigital number, since it uses as much as digits as its factorization.
13321102141001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 835735.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 13321102141001 its reverse (10014120112331), we get a palindrome (23335222253332).
The spelling of 13321102141001 in words is "thirteen trillion, three hundred twenty-one billion, one hundred two million, one hundred forty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •