Base | Representation |
---|---|
bin | 1100000111111010001101… |
… | …0110100010001111001101 |
3 | 1202012100010022002112100112 |
4 | 3001332203112202033031 |
5 | 3221344342133104401 |
6 | 44203421210405405 |
7 | 2544030265312343 |
oct | 301764326421715 |
9 | 52170108075315 |
10 | 13330024113101 |
11 | 427a26010a603 |
12 | 15b3546130865 |
13 | 759028b72707 |
14 | 34126888b993 |
15 | 181b27b343bb |
hex | c1fa35a23cd |
13330024113101 has 16 divisors (see below), whose sum is σ = 14642627783040. Its totient is φ = 12078594316800.
The previous prime is 13330024113079. The next prime is 13330024113233. The reversal of 13330024113101 is 10131142003331.
It is a cyclic number.
It is not a de Polignac number, because 13330024113101 - 210 = 13330024112077 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13330024113401) 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 15 ways as a sum of consecutive naturals, for example, 5776001 + ... + 7747401.
It is an arithmetic number, because the mean of its divisors is an integer number (915164236440).
Almost surely, 213330024113101 is an apocalyptic number.
It is an amenable number.
13330024113101 is a deficient number, since it is larger than the sum of its proper divisors (1312603669939).
13330024113101 is a wasteful number, since it uses less digits than its factorization.
13330024113101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1986916.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 13330024113101 its reverse (10131142003331), we get a palindrome (23461166116432).
The spelling of 13330024113101 in words is "thirteen trillion, three hundred thirty billion, twenty-four million, one hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •