Base | Representation |
---|---|
bin | 1100000110110100000101… |
… | …0111110001011111111001 |
3 | 1202010112112102221220022010 |
4 | 3001231001113301133321 |
5 | 3221042314300321101 |
6 | 44151025301120133 |
7 | 2542462645355400 |
oct | 301550127613771 |
9 | 52115472856263 |
10 | 13311200401401 |
11 | 4272280671381 |
12 | 15ab9720b9049 |
13 | 7573190a9576 |
14 | 3403a08c2637 |
15 | 1813c52bd2d6 |
hex | c1b415f17f9 |
13311200401401 has 12 divisors (see below), whose sum is σ = 20645943479952. Its totient is φ = 7606400229288.
The previous prime is 13311200401393. The next prime is 13311200401417. The reversal of 13311200401401 is 10410400211331.
It is not a de Polignac number, because 13311200401401 - 23 = 13311200401393 is a prime.
It is a super-2 number, since 2×133112004014012 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (13311200401451) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 45276191695 + ... + 45276191988.
It is an arithmetic number, because the mean of its divisors is an integer number (1720495289996).
Almost surely, 213311200401401 is an apocalyptic number.
It is an amenable number.
13311200401401 is a deficient number, since it is larger than the sum of its proper divisors (7334743078551).
13311200401401 is an equidigital number, since it uses as much as digits as its factorization.
13311200401401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90552383700 (or 90552383693 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 13311200401401 its reverse (10410400211331), we get a palindrome (23721600612732).
The spelling of 13311200401401 in words is "thirteen trillion, three hundred eleven billion, two hundred million, four hundred one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •