Base | Representation |
---|---|
bin | 1110010001001001001… |
… | …1010111101001000011 |
3 | 212102200211220111112022 |
4 | 3210102103113221003 |
5 | 13004001233001311 |
6 | 304335012352055 |
7 | 23465210231213 |
oct | 3442223275103 |
9 | 772624814468 |
10 | 245120203331 |
11 | 94a55a67843 |
12 | 3b60a31562b |
13 | 1a1650c8943 |
14 | bc146c0243 |
15 | 65997085db |
hex | 39124d7a43 |
245120203331 has 4 divisors (see below), whose sum is σ = 246390256392. Its totient is φ = 243850150272.
The previous prime is 245120203319. The next prime is 245120203337. The reversal of 245120203331 is 133302021542.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 245120203331 - 26 = 245120203267 is a prime.
It is a super-2 number, since 2×2451202033312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 245120203331.
It is not an unprimeable number, because it can be changed into a prime (245120203337) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 635026241 + ... + 635026626.
It is an arithmetic number, because the mean of its divisors is an integer number (61597564098).
Almost surely, 2245120203331 is an apocalyptic number.
245120203331 is a deficient number, since it is larger than the sum of its proper divisors (1270053061).
245120203331 is a wasteful number, since it uses less digits than its factorization.
245120203331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1270053060.
The product of its (nonzero) digits is 4320, while the sum is 26.
Adding to 245120203331 its reverse (133302021542), we get a palindrome (378422224873).
The spelling of 245120203331 in words is "two hundred forty-five billion, one hundred twenty million, two hundred three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.157 sec. • engine limits •