Base | Representation |
---|---|
bin | 1110010010110010010… |
… | …0111100111101000111 |
3 | 212110211120101022122011 |
4 | 3210230210330331013 |
5 | 13010402110121411 |
6 | 304450440515051 |
7 | 23512142142532 |
oct | 3445444747507 |
9 | 773746338564 |
10 | 245561020231 |
11 | 9516188102a |
12 | 3b711a7ba87 |
13 | 1a20552b847 |
14 | bc5706ba19 |
15 | 65c3280c21 |
hex | 392c93cf47 |
245561020231 has 8 divisors (see below), whose sum is σ = 256659738624. Its totient is φ = 234497481240.
The previous prime is 245561020219. The next prime is 245561020253. The reversal of 245561020231 is 132020165542.
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 245561020231 - 29 = 245561019719 is a prime.
It is a super-2 number, since 2×2455610202312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 245561020193 and 245561020202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (245561020261) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8780575 + ... + 8808496.
It is an arithmetic number, because the mean of its divisors is an integer number (32082467328).
Almost surely, 2245561020231 is an apocalyptic number.
245561020231 is a deficient number, since it is larger than the sum of its proper divisors (11098718393).
245561020231 is a wasteful number, since it uses less digits than its factorization.
245561020231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17589701.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 245561020231 its reverse (132020165542), we get a palindrome (377581185773).
The spelling of 245561020231 in words is "two hundred forty-five billion, five hundred sixty-one million, twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •