Base | Representation |
---|---|
bin | 1110010001011100010… |
… | …1011111000111101111 |
3 | 212102220102220110022022 |
4 | 3210113011133013233 |
5 | 13004132303400111 |
6 | 304351000340355 |
7 | 23500203302465 |
oct | 3442705370757 |
9 | 772812813268 |
10 | 245200450031 |
11 | 94a97297329 |
12 | 3b6311746bb |
13 | 1a1789143b4 |
14 | bc2120c835 |
15 | 65a17aa2db |
hex | 391715f1ef |
245200450031 has 8 divisors (see below), whose sum is σ = 247384525344. Its totient is φ = 243016623360.
The previous prime is 245200450009. The next prime is 245200450043. The reversal of 245200450031 is 130054002542.
It is a happy number.
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 245200450031 - 222 = 245196255727 is a prime.
It is a super-2 number, since 2×2452004500312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (245200450531) 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 7 ways as a sum of consecutive naturals, for example, 2324915 + ... + 2428091.
It is an arithmetic number, because the mean of its divisors is an integer number (30923065668).
Almost surely, 2245200450031 is an apocalyptic number.
245200450031 is a deficient number, since it is larger than the sum of its proper divisors (2184075313).
245200450031 is a wasteful number, since it uses less digits than its factorization.
245200450031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124321.
The product of its (nonzero) digits is 4800, while the sum is 26.
Adding to 245200450031 its reverse (130054002542), we get a palindrome (375254452573).
The spelling of 245200450031 in words is "two hundred forty-five billion, two hundred million, four hundred fifty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •