Base | Representation |
---|---|
bin | 10111010110000001011011… |
… | …111011000010111010010111 |
3 | 111110112000012010210110100222 |
4 | 113112001123323002322113 |
5 | 101424104431223324123 |
6 | 1002205121434224555 |
7 | 30424356443542145 |
oct | 2726013373027227 |
9 | 443460163713328 |
10 | 102668440448663 |
11 | 2a793494088621 |
12 | b6219b8b8515b |
13 | 453979163c1cb |
14 | 1b4d271396595 |
15 | bd0995d6b6c8 |
hex | 5d605bec2e97 |
102668440448663 has 32 divisors (see below), whose sum is σ = 111391603308480. Its totient is φ = 94330033920000.
The previous prime is 102668440448557. The next prime is 102668440448671. The reversal of 102668440448663 is 366844044866201.
It is a cyclic number.
It is not a de Polignac number, because 102668440448663 - 246 = 32299696270999 is a prime.
It is a super-4 number, since 4×1026684404486634 (a number of 57 digits) contains 4444 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102668440448596 and 102668440448605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102668440448863) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 26391581 + ... + 30030857.
It is an arithmetic number, because the mean of its divisors is an integer number (3480987603390).
Almost surely, 2102668440448663 is an apocalyptic number.
102668440448663 is a deficient number, since it is larger than the sum of its proper divisors (8723162859817).
102668440448663 is a wasteful number, since it uses less digits than its factorization.
102668440448663 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3639699.
The product of its (nonzero) digits is 127401984, while the sum is 62.
The spelling of 102668440448663 in words is "one hundred two trillion, six hundred sixty-eight billion, four hundred forty million, four hundred forty-eight thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •