Base | Representation |
---|---|
bin | 1001111011011001… |
… | …00101010100010111 |
3 | 111202110110100011100 |
4 | 10331230211110113 |
5 | 41403444032123 |
6 | 2240521441143 |
7 | 246040542060 |
oct | 47554452427 |
9 | 14673410140 |
10 | 5330064663 |
11 | 2295756520 |
12 | 10490401b3 |
13 | 66c354c21 |
14 | 387c5d567 |
15 | 212e03643 |
hex | 13db25517 |
5330064663 has 72 divisors (see below), whose sum is σ = 9717791616. Its totient is φ = 2734934400.
The previous prime is 5330064631. The next prime is 5330064683. The reversal of 5330064663 is 3664600335.
It is a happy number.
5330064663 is a `hidden beast` number, since 5 + 3 + 3 + 0 + 0 + 646 + 6 + 3 = 666.
It is not a de Polignac number, because 5330064663 - 25 = 5330064631 is a prime.
It is a super-3 number, since 3×53300646633 (a number of 30 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5330064683) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 5488768 + ... + 5489738.
It is an arithmetic number, because the mean of its divisors is an integer number (134969328).
Almost surely, 25330064663 is an apocalyptic number.
5330064663 is a deficient number, since it is larger than the sum of its proper divisors (4387726953).
5330064663 is a wasteful number, since it uses less digits than its factorization.
5330064663 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1173 (or 1081 counting only the distinct ones).
The product of its (nonzero) digits is 116640, while the sum is 36.
The square root of 5330064663 is about 73007.2918481435. The cubic root of 5330064663 is about 1746.8039257111.
Adding to 5330064663 its reverse (3664600335), we get a palindrome (8994664998).
The spelling of 5330064663 in words is "five billion, three hundred thirty million, sixty-four thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •