Base | Representation |
---|---|
bin | 10011010011001101000… |
… | …01110100011001111101 |
3 | 2100101200201111202020121 |
4 | 21221212201310121331 |
5 | 41331110121330041 |
6 | 1224351125014541 |
7 | 65624232250060 |
oct | 11514641643175 |
9 | 2311621452217 |
10 | 663145105021 |
11 | 23626913a603 |
12 | a8631b54451 |
13 | 4a6c3b75a89 |
14 | 2414c7128d7 |
15 | 123b37787d1 |
hex | 9a6687467d |
663145105021 has 4 divisors (see below), whose sum is σ = 757880120032. Its totient is φ = 568410090012.
The previous prime is 663145105001. The next prime is 663145105027. The reversal of 663145105021 is 120501541366.
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 663145105021 - 217 = 663144973949 is a prime.
It is a super-2 number, since 2×6631451050212 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (663145105027) 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, 47367507495 + ... + 47367507508.
It is an arithmetic number, because the mean of its divisors is an integer number (189470030008).
Almost surely, 2663145105021 is an apocalyptic number.
It is an amenable number.
663145105021 is a deficient number, since it is larger than the sum of its proper divisors (94735015011).
663145105021 is an equidigital number, since it uses as much as digits as its factorization.
663145105021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94735015010.
The product of its (nonzero) digits is 21600, while the sum is 34.
Adding to 663145105021 its reverse (120501541366), we get a palindrome (783646646387).
The spelling of 663145105021 in words is "six hundred sixty-three billion, one hundred forty-five million, one hundred five thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •