Base | Representation |
---|---|
bin | 1110010011001110101… |
… | …1010000001101010101 |
3 | 212111010212110211110210 |
4 | 3210303223100031111 |
5 | 13011123102044334 |
6 | 304510333240033 |
7 | 23515116333321 |
oct | 3446353201525 |
9 | 774125424423 |
10 | 245680112469 |
11 | 95213022870 |
12 | 3b745933019 |
13 | 1a2240c851c |
14 | bc68bcc981 |
15 | 65cd9575e9 |
hex | 3933ad0355 |
245680112469 has 16 divisors (see below), whose sum is σ = 357386554944. Its totient is φ = 148883011200.
The previous prime is 245680112467. The next prime is 245680112507. The reversal of 245680112469 is 964211086542.
245680112469 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 245680112469 - 21 = 245680112467 is a prime.
It is a super-2 number, since 2×2456801124692 (a number of 24 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (245680112467) 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 15 ways as a sum of consecutive naturals, for example, 10497 + ... + 701049.
It is an arithmetic number, because the mean of its divisors is an integer number (22336659684).
Almost surely, 2245680112469 is an apocalyptic number.
It is an amenable number.
245680112469 is a deficient number, since it is larger than the sum of its proper divisors (111706442475).
245680112469 is a wasteful number, since it uses less digits than its factorization.
245680112469 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 701348.
The product of its (nonzero) digits is 829440, while the sum is 48.
The spelling of 245680112469 in words is "two hundred forty-five billion, six hundred eighty million, one hundred twelve thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •