Base | Representation |
---|---|
bin | 1110010011000010011… |
… | …1100101100100110110 |
3 | 212111000021221220010001 |
4 | 3210300213211210312 |
5 | 13011021434213031 |
6 | 304501302021514 |
7 | 23513624343031 |
oct | 3446047454466 |
9 | 774007856101 |
10 | 245628819766 |
11 | 95197079900 |
12 | 3b73071789a |
13 | 1a2165a9905 |
14 | bc6207a018 |
15 | 65c91c4861 |
hex | 39309e5936 |
245628819766 has 12 divisors (see below), whose sum is σ = 404983054476. Its totient is φ = 111649463420.
The previous prime is 245628819707. The next prime is 245628819767. The reversal of 245628819766 is 667918826542.
245628819766 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2456288197662 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 245628819698 and 245628819707.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (245628819767) 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 5 ways as a sum of consecutive naturals, for example, 507497320 + ... + 507497803.
It is an arithmetic number, because the mean of its divisors is an integer number (33748587873).
Almost surely, 2245628819766 is an apocalyptic number.
245628819766 is a deficient number, since it is larger than the sum of its proper divisors (159354234710).
245628819766 is a wasteful number, since it uses less digits than its factorization.
245628819766 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1014995147 (or 1014995136 counting only the distinct ones).
The product of its digits is 69672960, while the sum is 64.
The spelling of 245628819766 in words is "two hundred forty-five billion, six hundred twenty-eight million, eight hundred nineteen thousand, seven hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.149 sec. • engine limits •