Base | Representation |
---|---|
bin | 101110111100100110001… |
… | …101011001011101110001 |
3 | 102102102021202000010120122 |
4 | 232330212031121131301 |
5 | 410324134320020211 |
6 | 10510024513020025 |
7 | 452040201111101 |
oct | 56744615313561 |
9 | 12372252003518 |
10 | 3226161485681 |
11 | 1034231064322 |
12 | 441302b54615 |
13 | 1a52c1bb3504 |
14 | b220b707201 |
15 | 58dbe8196db |
hex | 2ef26359771 |
3226161485681 has 4 divisors (see below), whose sum is σ = 3237561349872. Its totient is φ = 3214761621492.
The previous prime is 3226161485653. The next prime is 3226161485683. The reversal of 3226161485681 is 1865841616223.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3226161485681 is a prime.
It is a super-2 number, since 2×32261614856812 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (3226161485683) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5699931671 + ... + 5699932236.
It is an arithmetic number, because the mean of its divisors is an integer number (809390337468).
Almost surely, 23226161485681 is an apocalyptic number.
It is an amenable number.
3226161485681 is a deficient number, since it is larger than the sum of its proper divisors (11399864191).
3226161485681 is a wasteful number, since it uses less digits than its factorization.
3226161485681 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11399864190.
The product of its digits is 3317760, while the sum is 53.
The spelling of 3226161485681 in words is "three trillion, two hundred twenty-six billion, one hundred sixty-one million, four hundred eighty-five thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •