Base | Representation |
---|---|
bin | 111110001110000101100… |
… | …000000111000010000101 |
3 | 120010202102010120010110001 |
4 | 332032011200013002011 |
5 | 1030023144423343121 |
6 | 13032124433001301 |
7 | 620624426302141 |
oct | 76160540070205 |
9 | 16122363503401 |
10 | 4275732246661 |
11 | 13a9367426677 |
12 | 5907ba0b3231 |
13 | 25027a010985 |
14 | 10ad37468221 |
15 | 7634cdd8991 |
hex | 3e385807085 |
4275732246661 has 4 divisors (see below), whose sum is σ = 4348202284800. Its totient is φ = 4203262208524.
The previous prime is 4275732246659. The next prime is 4275732246671. The reversal of 4275732246661 is 1666422375724.
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 not a de Polignac number, because 4275732246661 - 21 = 4275732246659 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4275732246641) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 36235018981 + ... + 36235019098.
It is an arithmetic number, because the mean of its divisors is an integer number (1087050571200).
Almost surely, 24275732246661 is an apocalyptic number.
It is an amenable number.
4275732246661 is a deficient number, since it is larger than the sum of its proper divisors (72470038139).
4275732246661 is an equidigital number, since it uses as much as digits as its factorization.
4275732246661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72470038138.
The product of its digits is 20321280, while the sum is 55.
The spelling of 4275732246661 in words is "four trillion, two hundred seventy-five billion, seven hundred thirty-two million, two hundred forty-six thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •