Base | Representation |
---|---|
bin | 111100101010001111… |
… | …011011111011000111 |
3 | 20020010020121100001110 |
4 | 330222033123323013 |
5 | 2031343044332142 |
6 | 45531034300103 |
7 | 4464030025410 |
oct | 745217337307 |
9 | 206106540043 |
10 | 65133199047 |
11 | 25693aa1524 |
12 | 10758b87633 |
13 | 61b0084687 |
14 | 321c508807 |
15 | 1a6321a99c |
hex | f2a3dbec7 |
65133199047 has 64 divisors (see below), whose sum is σ = 105451520000. Its totient is φ = 34968205440.
The previous prime is 65133199013. The next prime is 65133199069. The reversal of 65133199047 is 74099133156.
It is not a de Polignac number, because 65133199047 - 214 = 65133182663 is a prime.
It is a super-2 number, since 2×651331990472 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 65133198987 and 65133199005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (65133199097) 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 63 ways as a sum of consecutive naturals, for example, 12016704 + ... + 12022122.
It is an arithmetic number, because the mean of its divisors is an integer number (1647680000).
Almost surely, 265133199047 is an apocalyptic number.
65133199047 is a deficient number, since it is larger than the sum of its proper divisors (40318320953).
65133199047 is a wasteful number, since it uses less digits than its factorization.
65133199047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5996.
The product of its (nonzero) digits is 612360, while the sum is 48.
The spelling of 65133199047 in words is "sixty-five billion, one hundred thirty-three million, one hundred ninety-nine thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •