Base | Representation |
---|---|
bin | 111101000011000110… |
… | …010101110001101001 |
3 | 20021012022100110111201 |
4 | 331003012111301221 |
5 | 2033221330314334 |
6 | 50040253124201 |
7 | 4510252613626 |
oct | 750306256151 |
9 | 207168313451 |
10 | 65550244969 |
11 | 2588844a280 |
12 | 10854789661 |
13 | 62485b3901 |
14 | 325ba6934d |
15 | 1a89b49c14 |
hex | f43195c69 |
65550244969 has 4 divisors (see below), whose sum is σ = 71509358160. Its totient is φ = 59591131780.
The previous prime is 65550244957. The next prime is 65550244987. The reversal of 65550244969 is 96944205556.
65550244969 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 65550244969 - 211 = 65550242921 is a prime.
It is a super-2 number, since 2×655502449692 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (65550244939) 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, 2979556579 + ... + 2979556600.
It is an arithmetic number, because the mean of its divisors is an integer number (17877339540).
Almost surely, 265550244969 is an apocalyptic number.
It is an amenable number.
65550244969 is a deficient number, since it is larger than the sum of its proper divisors (5959113191).
65550244969 is a wasteful number, since it uses less digits than its factorization.
65550244969 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5959113190.
The product of its (nonzero) digits is 11664000, while the sum is 55.
The spelling of 65550244969 in words is "sixty-five billion, five hundred fifty million, two hundred forty-four thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •