Base | Representation |
---|---|
bin | 11001000100010000… |
… | …01100000001111101 |
3 | 1021201212121111100102 |
4 | 30202020030001331 |
5 | 210030103124121 |
6 | 10103212210445 |
7 | 654326432042 |
oct | 144210140175 |
9 | 37655544312 |
10 | 13457473661 |
11 | 5786436165 |
12 | 2736a69a25 |
13 | 13660b7388 |
14 | 9194111c9 |
15 | 53b6b990b |
hex | 32220c07d |
13457473661 has 4 divisors (see below), whose sum is σ = 13457757852. Its totient is φ = 13457189472.
The previous prime is 13457473657. The next prime is 13457473663. The reversal of 13457473661 is 16637475431.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 12278856100 + 1178617561 = 110810^2 + 34331^2 .
It is a cyclic number.
It is not a de Polignac number, because 13457473661 - 22 = 13457473657 is a prime.
It is a super-2 number, since 2×134574736612 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13457473663) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 52040 + ... + 172113.
It is an arithmetic number, because the mean of its divisors is an integer number (3364439463).
Almost surely, 213457473661 is an apocalyptic number.
It is an amenable number.
13457473661 is a deficient number, since it is larger than the sum of its proper divisors (284191).
13457473661 is an equidigital number, since it uses as much as digits as its factorization.
13457473661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 284190.
The product of its digits is 1270080, while the sum is 47.
The spelling of 13457473661 in words is "thirteen billion, four hundred fifty-seven million, four hundred seventy-three thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •