Base | Representation |
---|---|
bin | 111100110111010110100… |
… | …110110101000100000111 |
3 | 112210212000211201212111112 |
4 | 330313112212311010013 |
5 | 1022011433020311210 |
6 | 12521243412355235 |
7 | 611116550461031 |
oct | 74672646650407 |
9 | 15725024655445 |
10 | 4182603682055 |
11 | 13729178136a7 |
12 | 576749615b1b |
13 | 244557ca1b46 |
14 | 106620c58c51 |
15 | 73bec06ed05 |
hex | 3cdd69b5107 |
4182603682055 has 4 divisors (see below), whose sum is σ = 5019124418472. Its totient is φ = 3346082945640.
The previous prime is 4182603681961. The next prime is 4182603682091. The reversal of 4182603682055 is 5502863062814.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 4182603682055 - 214 = 4182603665671 is a prime.
It is a super-2 number, since 2×41826036820552 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4182603681994 and 4182603682012.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 418260368201 + ... + 418260368210.
It is an arithmetic number, because the mean of its divisors is an integer number (1254781104618).
Almost surely, 24182603682055 is an apocalyptic number.
4182603682055 is a deficient number, since it is larger than the sum of its proper divisors (836520736417).
4182603682055 is an equidigital number, since it uses as much as digits as its factorization.
4182603682055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 836520736416.
The product of its (nonzero) digits is 2764800, while the sum is 50.
The spelling of 4182603682055 in words is "four trillion, one hundred eighty-two billion, six hundred three million, six hundred eighty-two thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •