Base | Representation |
---|---|
bin | 101010010110101010… |
… | …001011111111000001 |
3 | 11100101101120221110101 |
4 | 222112222023333001 |
5 | 1221114143030442 |
6 | 32520400402401 |
7 | 3166653536506 |
oct | 522652137701 |
9 | 140341527411 |
10 | 45477314497 |
11 | 1831783853a |
12 | 8992316401 |
13 | 4399a82664 |
14 | 22b5bdb4ad |
15 | 12b27c4cb7 |
hex | a96a8bfc1 |
45477314497 has 8 divisors (see below), whose sum is σ = 45732551400. Its totient is φ = 45222570624.
The previous prime is 45477314479. The next prime is 45477314591. The reversal of 45477314497 is 79441377454.
It can be written as a sum of positive squares in 4 ways, for example, as 21500650161 + 23976664336 = 146631^2 + 154844^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 45477314497 - 219 = 45476790209 is a prime.
It is a super-2 number, since 2×454773144972 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (45477314447) 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 7 ways as a sum of consecutive naturals, for example, 62523 + ... + 307999.
It is an arithmetic number, because the mean of its divisors is an integer number (5716568925).
Almost surely, 245477314497 is an apocalyptic number.
It is an amenable number.
45477314497 is a deficient number, since it is larger than the sum of its proper divisors (255236903).
45477314497 is a wasteful number, since it uses less digits than its factorization.
45477314497 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 246515.
The product of its digits is 11854080, while the sum is 55.
The spelling of 45477314497 in words is "forty-five billion, four hundred seventy-seven million, three hundred fourteen thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •