Base | Representation |
---|---|
bin | 101010000000111110… |
… | …110100100001000001 |
3 | 11022110001020120202201 |
4 | 222000332310201001 |
5 | 1214343041442031 |
6 | 32420325313201 |
7 | 3154646324311 |
oct | 520076644101 |
9 | 138401216681 |
10 | 45113624641 |
11 | 18150512a08 |
12 | 88b0565801 |
13 | 433c615267 |
14 | 227d7a9441 |
15 | 12908d4d61 |
hex | a80fb4841 |
45113624641 has 4 divisors (see below), whose sum is σ = 46669266900. Its totient is φ = 43557982384.
The previous prime is 45113624629. The next prime is 45113624683. The reversal of 45113624641 is 14642631154.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 14642631154 = 2 ⋅7321315577.
It can be written as a sum of positive squares in 2 ways, for example, as 15605256241 + 29508368400 = 124921^2 + 171780^2 .
It is a cyclic number.
It is not a de Polignac number, because 45113624641 - 229 = 44576753729 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 45113624641.
It is not an unprimeable number, because it can be changed into a prime (45113624041) 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, 777821086 + ... + 777821143.
It is an arithmetic number, because the mean of its divisors is an integer number (11667316725).
Almost surely, 245113624641 is an apocalyptic number.
It is an amenable number.
45113624641 is a deficient number, since it is larger than the sum of its proper divisors (1555642259).
45113624641 is a wasteful number, since it uses less digits than its factorization.
45113624641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1555642258.
The product of its digits is 69120, while the sum is 37.
The spelling of 45113624641 in words is "forty-five billion, one hundred thirteen million, six hundred twenty-four thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.157 sec. • engine limits •