Base | Representation |
---|---|
bin | 1100011001011000000111… |
… | …1100011001110110100001 |
3 | 1210021000200220010102011020 |
4 | 3012112001330121312201 |
5 | 3241303431444404401 |
6 | 44553330421040053 |
7 | 2604512602450611 |
oct | 306260174316641 |
9 | 53230626112136 |
10 | 13630111325601 |
11 | 4385552563951 |
12 | 1641734856029 |
13 | 77b410a88544 |
14 | 3519b5412a41 |
15 | 18983ccbdd36 |
hex | c6581f19da1 |
13630111325601 has 4 divisors (see below), whose sum is σ = 18173481767472. Its totient is φ = 9086740883732.
The previous prime is 13630111325557. The next prime is 13630111325629. The reversal of 13630111325601 is 10652311103631.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13630111325601 - 222 = 13630107131297 is a prime.
It is a super-2 number, since 2×136301113256012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13630111335601) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2271685220931 + ... + 2271685220936.
It is an arithmetic number, because the mean of its divisors is an integer number (4543370441868).
Almost surely, 213630111325601 is an apocalyptic number.
It is an amenable number.
13630111325601 is a deficient number, since it is larger than the sum of its proper divisors (4543370441871).
13630111325601 is an equidigital number, since it uses as much as digits as its factorization.
13630111325601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4543370441870.
The product of its (nonzero) digits is 9720, while the sum is 33.
The spelling of 13630111325601 in words is "thirteen trillion, six hundred thirty billion, one hundred eleven million, three hundred twenty-five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •