Base | Representation |
---|---|
bin | 100011011000110101010… |
… | …1000001100100010001100 |
3 | 122012222001001101020211121 |
4 | 1012301222220030202030 |
5 | 1114141320111313233 |
6 | 14202203232530324 |
7 | 1011250551015610 |
oct | 106615250144214 |
9 | 18188031336747 |
10 | 4863691901068 |
11 | 1605753311330 |
12 | 6667486b09a4 |
13 | 29384b34b720 |
14 | 12b5925cb340 |
15 | 867b0bb692d |
hex | 46c6aa0c88c |
4863691901068 has 96 divisors (see below), whose sum is σ = 11429068105728. Its totient is φ = 1749012652800.
The previous prime is 4863691901027. The next prime is 4863691901083. The reversal of 4863691901068 is 8601091963684.
It is a junction number, because it is equal to n+sod(n) for n = 4863691900997 and 4863691901015.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 46478221 + ... + 46582747.
It is an arithmetic number, because the mean of its divisors is an integer number (119052792768).
Almost surely, 24863691901068 is an apocalyptic number.
It is an amenable number.
4863691901068 is an abundant number, since it is smaller than the sum of its proper divisors (6565376204660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4863691901068 is a wasteful number, since it uses less digits than its factorization.
4863691901068 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116183 (or 116181 counting only the distinct ones).
The product of its (nonzero) digits is 13436928, while the sum is 61.
The spelling of 4863691901068 in words is "four trillion, eight hundred sixty-three billion, six hundred ninety-one million, nine hundred one thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •