Base | Representation |
---|---|
bin | 10011010011000001110… |
… | …00001000001010110001 |
3 | 2100101110010002122021021 |
4 | 21221200320020022301 |
5 | 41330411333233331 |
6 | 1224333500455441 |
7 | 65622001321012 |
oct | 11514070101261 |
9 | 2311403078237 |
10 | 663050289841 |
11 | 23621a66a555 |
12 | a860624a581 |
13 | 4a6aa329214 |
14 | 2413dcb1009 |
15 | 123aa29a211 |
hex | 9a60e082b1 |
663050289841 has 3 divisors (see below), whose sum is σ = 663051104121. Its totient is φ = 663049475562.
The previous prime is 663050289809. The next prime is 663050289851. The reversal of 663050289841 is 148982050366.
The square root of 663050289841 is 814279.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is not a de Polignac number, because 663050289841 - 25 = 663050289809 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (663050289851) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 407140 + ... + 1221418.
It is an arithmetic number, because the mean of its divisors is an integer number (221017034707).
Almost surely, 2663050289841 is an apocalyptic number.
663050289841 is the 814279-th square number.
663050289841 is the 407140-th centered octagonal number.
It is an amenable number.
663050289841 is a deficient number, since it is larger than the sum of its proper divisors (814280).
663050289841 is an frugal number, since it uses more digits than its factorization.
663050289841 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1628558 (or 814279 counting only the distinct ones).
The product of its (nonzero) digits is 2488320, while the sum is 52.
The spelling of 663050289841 in words is "six hundred sixty-three billion, fifty million, two hundred eighty-nine thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •