Base | Representation |
---|---|
bin | 101010001100000101… |
… | …110011111000101101 |
3 | 11022221000221202112111 |
4 | 222030011303320231 |
5 | 1220233300201240 |
6 | 32451024204021 |
7 | 3162401462431 |
oct | 521405637055 |
9 | 138830852474 |
10 | 45300006445 |
11 | 18236744361 |
12 | 8942a69611 |
13 | 436c111b55 |
14 | 229a4449c1 |
15 | 12a1e4e1ea |
hex | a8c173e2d |
45300006445 has 4 divisors (see below), whose sum is σ = 54360007740. Its totient is φ = 36240005152.
The previous prime is 45300006439. The next prime is 45300006449. The reversal of 45300006445 is 54460000354.
45300006445 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 7476369156 + 37823637289 = 86466^2 + 194483^2 .
It is a cyclic number.
It is not a de Polignac number, because 45300006445 - 25 = 45300006413 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (45300006449) 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, 4530000640 + ... + 4530000649.
It is an arithmetic number, because the mean of its divisors is an integer number (13590001935).
Almost surely, 245300006445 is an apocalyptic number.
It is an amenable number.
45300006445 is a deficient number, since it is larger than the sum of its proper divisors (9060001295).
45300006445 is an equidigital number, since it uses as much as digits as its factorization.
45300006445 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9060001294.
The product of its (nonzero) digits is 28800, while the sum is 31.
Adding to 45300006445 its reverse (54460000354), we get a palindrome (99760006799).
The spelling of 45300006445 in words is "forty-five billion, three hundred million, six thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •