Base | Representation |
---|---|
bin | 101010001111110111… |
… | …110000010001110001 |
3 | 11100002110022001000001 |
4 | 222033313300101301 |
5 | 1220401014234023 |
6 | 32501211430001 |
7 | 3164101540312 |
oct | 521767602161 |
9 | 140073261001 |
10 | 45363430513 |
11 | 18269523845 |
12 | 8960155301 |
13 | 437c2ba49b |
14 | 22a4a34609 |
15 | 12a77cb6ad |
hex | a8fdf0471 |
45363430513 has 4 divisors (see below), whose sum is σ = 48031867620. Its totient is φ = 42694993408.
The previous prime is 45363430451. The next prime is 45363430523. The reversal of 45363430513 is 31503436354.
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 41368305664 + 3995124849 = 203392^2 + 63207^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-45363430513 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (45363430523) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1334218528 + ... + 1334218561.
It is an arithmetic number, because the mean of its divisors is an integer number (12007966905).
Almost surely, 245363430513 is an apocalyptic number.
It is an amenable number.
45363430513 is a deficient number, since it is larger than the sum of its proper divisors (2668437107).
45363430513 is a wasteful number, since it uses less digits than its factorization.
45363430513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2668437106.
The product of its (nonzero) digits is 194400, while the sum is 37.
Adding to 45363430513 its reverse (31503436354), we get a palindrome (76866866867).
The spelling of 45363430513 in words is "forty-five billion, three hundred sixty-three million, four hundred thirty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •