Base | Representation |
---|---|
bin | 100011101110111000101… |
… | …1000001101110001011101 |
3 | 122101111021111121102000110 |
4 | 1013131301120031301131 |
5 | 1120430312221330410 |
6 | 14240034412520233 |
7 | 1014545251321335 |
oct | 107356130156135 |
9 | 18344244542013 |
10 | 4911049792605 |
11 | 1623845639170 |
12 | 673964780079 |
13 | 2981578c4058 |
14 | 12d9a60780c5 |
15 | 87b3360e720 |
hex | 4777160dc5d |
4911049792605 has 32 divisors (see below), whose sum is σ = 8572331088000. Its totient is φ = 2381027022080.
The previous prime is 4911049792567. The next prime is 4911049792639. The reversal of 4911049792605 is 5062979401194.
It is a happy number.
It is not a de Polignac number, because 4911049792605 - 210 = 4911049791581 is a prime.
It is a super-2 number, since 2×49110497926052 (a number of 26 digits) contains 22 as substring.
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 31 ways as a sum of consecutive naturals, for example, 4042279 + ... + 5114891.
It is an arithmetic number, because the mean of its divisors is an integer number (267885346500).
Almost surely, 24911049792605 is an apocalyptic number.
It is an amenable number.
4911049792605 is a deficient number, since it is larger than the sum of its proper divisors (3661281295395).
4911049792605 is a wasteful number, since it uses less digits than its factorization.
4911049792605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1100381.
The product of its (nonzero) digits is 4898880, while the sum is 57.
The spelling of 4911049792605 in words is "four trillion, nine hundred eleven billion, forty-nine million, seven hundred ninety-two thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •