Base | Representation |
---|---|
bin | 100001001000000010111… |
… | …1101010111001111110001 |
3 | 121010020111001010200021101 |
4 | 1002100011331113033301 |
5 | 1044043030404241331 |
6 | 13403302252524401 |
7 | 646632524404414 |
oct | 102200575271761 |
9 | 17106431120241 |
10 | 4552765305841 |
11 | 14a58a9363345 |
12 | 616433a80701 |
13 | 27042988696c |
14 | 11a4d8245b7b |
15 | 7d664118061 |
hex | 42405f573f1 |
4552765305841 has 27 divisors (see below), whose sum is σ = 4863958935843. Its totient is φ = 4260614092800.
The previous prime is 4552765305797. The next prime is 4552765305857. The reversal of 4552765305841 is 1485035672554.
The square root of 4552765305841 is 2133721.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 13 ways, for example, as 1084678507441 + 3468086798400 = 1041479^2 + 1862280^2 .
It is not a de Polignac number, because 4552765305841 - 27 = 4552765305713 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4552765308841) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 11353529241 + ... + 11353529641.
Almost surely, 24552765305841 is an apocalyptic number.
4552765305841 is the 2133721-st square number.
4552765305841 is the 1066861-st centered octagonal number.
It is an amenable number.
4552765305841 is a deficient number, since it is larger than the sum of its proper divisors (311193630002).
4552765305841 is an frugal number, since it uses more digits than its factorization.
4552765305841 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1462 (or 731 counting only the distinct ones).
The product of its (nonzero) digits is 20160000, while the sum is 55.
The spelling of 4552765305841 in words is "four trillion, five hundred fifty-two billion, seven hundred sixty-five million, three hundred five thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •