Base | Representation |
---|---|
bin | 1100010010100011110111… |
… | …0100101100000001100001 |
3 | 1202211211102111122220202111 |
4 | 3010220331310230001201 |
5 | 3232344113102211301 |
6 | 44423442151515321 |
7 | 2563165562452540 |
oct | 304507564540141 |
9 | 52754374586674 |
10 | 13513004335201 |
11 | 433a918733758 |
12 | 1622ab1988b41 |
13 | 77036a065197 |
14 | 34a0663c2157 |
15 | 186786cc6551 |
hex | c4a3dd2c061 |
13513004335201 has 16 divisors (see below), whose sum is σ = 16548881295744. Its totient is φ = 10769906859264.
The previous prime is 13513004335189. The next prime is 13513004335261. The reversal of 13513004335201 is 10253340031531.
It is a happy number.
It is not a de Polignac number, because 13513004335201 - 27 = 13513004335073 is a prime.
It is a super-2 number, since 2×135130043352012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13513004335261) 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 15 ways as a sum of consecutive naturals, for example, 684054330 + ... + 684074083.
It is an arithmetic number, because the mean of its divisors is an integer number (1034305080984).
Almost surely, 213513004335201 is an apocalyptic number.
It is an amenable number.
13513004335201 is a deficient number, since it is larger than the sum of its proper divisors (3035876960543).
13513004335201 is a wasteful number, since it uses less digits than its factorization.
13513004335201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1368128520.
The product of its (nonzero) digits is 16200, while the sum is 31.
Adding to 13513004335201 its reverse (10253340031531), we get a palindrome (23766344366732).
The spelling of 13513004335201 in words is "thirteen trillion, five hundred thirteen billion, four million, three hundred thirty-five thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •