Base | Representation |
---|---|
bin | 1110010000110110111… |
… | …0000001011001010111 |
3 | 212102111111012121111210 |
4 | 3210031232001121113 |
5 | 13003322041212043 |
6 | 304323224232503 |
7 | 23463254501040 |
oct | 3441556013127 |
9 | 772444177453 |
10 | 245043304023 |
11 | 94a166141a1 |
12 | 3b5a860b733 |
13 | 1a1521b29ab |
14 | bc083c38c7 |
15 | 6592ab8633 |
hex | 390db81657 |
245043304023 has 8 divisors (see below), whose sum is σ = 373399320448. Its totient is φ = 140024745144.
The previous prime is 245043304021. The next prime is 245043304043. The reversal of 245043304023 is 320403340542.
245043304023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 245043304023 - 21 = 245043304021 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (245043304021) 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 7 ways as a sum of consecutive naturals, for example, 5834364361 + ... + 5834364402.
It is an arithmetic number, because the mean of its divisors is an integer number (46674915056).
Almost surely, 2245043304023 is an apocalyptic number.
245043304023 is a deficient number, since it is larger than the sum of its proper divisors (128356016425).
245043304023 is a wasteful number, since it uses less digits than its factorization.
245043304023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11668728773.
The product of its (nonzero) digits is 34560, while the sum is 30.
Adding to 245043304023 its reverse (320403340542), we get a palindrome (565446644565).
The spelling of 245043304023 in words is "two hundred forty-five billion, forty-three million, three hundred four thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •