Base | Representation |
---|---|
bin | 100011110100010010101… |
… | …1110111110000000000001 |
3 | 122102121020201220000001021 |
4 | 1013220211132332000001 |
5 | 1121123102304141411 |
6 | 14245234525505441 |
7 | 1015436065323013 |
oct | 107504536760001 |
9 | 18377221800037 |
10 | 4922661396481 |
11 | 1628764030004 |
12 | 676065412281 |
13 | 29928844ab8a |
14 | 1303882721b3 |
15 | 880b2c0ea71 |
hex | 47a257be001 |
4922661396481 has 8 divisors (see below), whose sum is σ = 4929804910080. Its totient is φ = 4915518709248.
The previous prime is 4922661396473. The next prime is 4922661396629. The reversal of 4922661396481 is 1846931662294.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4922661396481 - 23 = 4922661396473 is a prime.
It is a super-2 number, since 2×49226613964812 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4922661396421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12260545 + ... + 12655681.
It is an arithmetic number, because the mean of its divisors is an integer number (616225613760).
Almost surely, 24922661396481 is an apocalyptic number.
It is an amenable number.
4922661396481 is a deficient number, since it is larger than the sum of its proper divisors (7143513599).
4922661396481 is a wasteful number, since it uses less digits than its factorization.
4922661396481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 413183.
The product of its digits is 26873856, while the sum is 61.
The spelling of 4922661396481 in words is "four trillion, nine hundred twenty-two billion, six hundred sixty-one million, three hundred ninety-six thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •