Base | Representation |
---|---|
bin | 11001100100110100… |
… | …00110101001001001 |
3 | 1022102220120000222200 |
4 | 30302122012221021 |
5 | 211110013340031 |
6 | 10150250310413 |
7 | 664154136144 |
oct | 146232065111 |
9 | 38386500880 |
10 | 13730605641 |
11 | 5906629275 |
12 | 27b2428409 |
13 | 13aa86892c |
14 | 9437cd05b |
15 | 55566c8e6 |
hex | 332686a49 |
13730605641 has 6 divisors (see below), whose sum is σ = 19833097050. Its totient is φ = 9153737088.
The previous prime is 13730605639. The next prime is 13730605769. The reversal of 13730605641 is 14650603731.
13730605641 is a `hidden beast` number, since 1 + 3 + 7 + 3 + 0 + 6 + 0 + 5 + 641 = 666.
It can be written as a sum of positive squares in only one way, i.e., 13399220025 + 331385616 = 115755^2 + 18204^2 .
It is not a de Polignac number, because 13730605641 - 21 = 13730605639 is a prime.
It is a super-2 number, since 2×137306056412 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13730605596 and 13730605605.
It is not an unprimeable number, because it can be changed into a prime (13730605541) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 762811416 + ... + 762811433.
It is an arithmetic number, because the mean of its divisors is an integer number (3305516175).
Almost surely, 213730605641 is an apocalyptic number.
It is an amenable number.
13730605641 is a deficient number, since it is larger than the sum of its proper divisors (6102491409).
13730605641 is a wasteful number, since it uses less digits than its factorization.
13730605641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1525622855 (or 1525622852 counting only the distinct ones).
The product of its (nonzero) digits is 45360, while the sum is 36.
The spelling of 13730605641 in words is "thirteen billion, seven hundred thirty million, six hundred five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •