Base | Representation |
---|---|
bin | 1001011011100011010010110… |
… | …0011110011100100010001110 |
3 | 10020000122200011200201200210110 |
4 | 2112320310230132130202032 |
5 | 1143440104031104210431 |
6 | 10311215024023020450 |
7 | 256531242141651222 |
oct | 22670645436344216 |
9 | 3200580150650713 |
10 | 663611848116366 |
11 | 1824a1227a33526 |
12 | 6251850929a726 |
13 | 2263943739b946 |
14 | b9c2db0504782 |
15 | 51ac1015a0346 |
hex | 25b8d2c79c88e |
663611848116366 has 128 divisors (see below), whose sum is σ = 1382441834202624. Its totient is φ = 212245579307520.
The previous prime is 663611848116361. The next prime is 663611848116377.
663611848116366 is nontrivially palindromic in base 10.
663611848116366 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 663611848116297 and 663611848116306.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (663611848116361) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 7024009920 + ... + 7024104396.
It is an arithmetic number, because the mean of its divisors is an integer number (10800326829708).
Almost surely, 2663611848116366 is an apocalyptic number.
663611848116366 is an abundant number, since it is smaller than the sum of its proper divisors (718829986086258).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
663611848116366 is a wasteful number, since it uses less digits than its factorization.
663611848116366 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97394.
The product of its digits is 107495424, while the sum is 66.
The spelling of 663611848116366 in words is "six hundred sixty-three trillion, six hundred eleven billion, eight hundred forty-eight million, one hundred sixteen thousand, three hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •