Base | Representation |
---|---|
bin | 1110010001000111101… |
… | …1111010101000111111 |
3 | 212102200102100010220220 |
4 | 3210101323322220333 |
5 | 13003443144231411 |
6 | 304334232512423 |
7 | 23465104043553 |
oct | 3442173725077 |
9 | 772612303826 |
10 | 245114055231 |
11 | 94a52548671 |
12 | 3b60824b713 |
13 | 1a163a55406 |
14 | bc1395d863 |
15 | 6598de1b06 |
hex | 3911efaa3f |
245114055231 has 32 divisors (see below), whose sum is σ = 356043878400. Its totient is φ = 149475870720.
The previous prime is 245114055169. The next prime is 245114055233. The reversal of 245114055231 is 132550411542.
It is not a de Polignac number, because 245114055231 - 26 = 245114055167 is a prime.
It is a super-2 number, since 2×2451140552312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 245114055192 and 245114055201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (245114055233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 313951 + ... + 767328.
It is an arithmetic number, because the mean of its divisors is an integer number (11126371200).
Almost surely, 2245114055231 is an apocalyptic number.
245114055231 is a deficient number, since it is larger than the sum of its proper divisors (110929823169).
245114055231 is a wasteful number, since it uses less digits than its factorization.
245114055231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1081439.
The product of its (nonzero) digits is 24000, while the sum is 33.
Adding to 245114055231 its reverse (132550411542), we get a palindrome (377664466773).
The spelling of 245114055231 in words is "two hundred forty-five billion, one hundred fourteen million, fifty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •