Base | Representation |
---|---|
bin | 1110010010101100100… |
… | …1010001101110000001 |
3 | 212110202220011100122202 |
4 | 3210223021101232001 |
5 | 13010324432104113 |
6 | 304444221442545 |
7 | 23511430651031 |
oct | 3445311215601 |
9 | 773686140582 |
10 | 245536988033 |
11 | 9514a257307 |
12 | 3b705a10455 |
13 | 1a200565ccc |
14 | bc53bb38c1 |
15 | 65c10d5258 |
hex | 392b251b81 |
245536988033 has 4 divisors (see below), whose sum is σ = 245610970560. Its totient is φ = 245463005508.
The previous prime is 245536988023. The next prime is 245536988041. The reversal of 245536988033 is 330889635542.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 245536988033 - 24 = 245536988017 is a prime.
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 245536988033.
It is not an unprimeable number, because it can be changed into a prime (245536988023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 36986285 + ... + 36992922.
It is an arithmetic number, because the mean of its divisors is an integer number (61402742640).
Almost surely, 2245536988033 is an apocalyptic number.
It is an amenable number.
245536988033 is a deficient number, since it is larger than the sum of its proper divisors (73982527).
245536988033 is an equidigital number, since it uses as much as digits as its factorization.
245536988033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73982526.
The product of its (nonzero) digits is 18662400, while the sum is 56.
The spelling of 245536988033 in words is "two hundred forty-five billion, five hundred thirty-six million, nine hundred eighty-eight thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •