Base | Representation |
---|---|
bin | 1100001100101000000010… |
… | …0010110111010110111001 |
3 | 1202111002020202021201101111 |
4 | 3003022000202313112321 |
5 | 3224211304344141101 |
6 | 44304540535120321 |
7 | 2552626120364302 |
oct | 303120042672671 |
9 | 52432222251344 |
10 | 13411044521401 |
11 | 430065700952a |
12 | 16071978130a1 |
13 | 76386b50b907 |
14 | 345152d677a9 |
15 | 183cba9b6251 |
hex | c32808b75b9 |
13411044521401 has 8 divisors (see below), whose sum is σ = 13611271063104. Its totient is φ = 13210819794480.
The previous prime is 13411044521389. The next prime is 13411044521521. The reversal of 13411044521401 is 10412544011431.
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 13411044521401 - 227 = 13410910303673 is a prime.
It is a super-2 number, since 2×134110445214012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13411044221401) 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, 25097316 + ... + 25626106.
It is an arithmetic number, because the mean of its divisors is an integer number (1701408882888).
Almost surely, 213411044521401 is an apocalyptic number.
It is an amenable number.
13411044521401 is a deficient number, since it is larger than the sum of its proper divisors (200226541703).
13411044521401 is an equidigital number, since it uses as much as digits as its factorization.
13411044521401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 907391.
The product of its (nonzero) digits is 7680, while the sum is 31.
Adding to 13411044521401 its reverse (10412544011431), we get a palindrome (23823588532832).
The spelling of 13411044521401 in words is "thirteen trillion, four hundred eleven billion, forty-four million, five hundred twenty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •