Base | Representation |
---|---|
bin | 100001000100101010000… |
… | …110111001101001011001 |
3 | 22001021100110002022201001 |
4 | 201010222012321221121 |
5 | 244214040000323031 |
6 | 4500030110425001 |
7 | 323125501353565 |
oct | 41045206715131 |
9 | 8037313068631 |
10 | 2272744151641 |
11 | 7a6957906877 |
12 | 308581502161 |
13 | 13641b6a2a52 |
14 | 7c003bd06a5 |
15 | 3e1bc919861 |
hex | 2112a1b9a59 |
2272744151641 has 4 divisors (see below), whose sum is σ = 2280949004452. Its totient is φ = 2264539298832.
The previous prime is 2272744151627. The next prime is 2272744151659. The reversal of 2272744151641 is 1461514472722.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 147502083600 + 2125242068041 = 384060^2 + 1457821^2 .
It is a cyclic number.
It is not a de Polignac number, because 2272744151641 - 29 = 2272744151129 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2272744151591 and 2272744151600.
It is not an unprimeable number, because it can be changed into a prime (2272744151621) 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, 4102425990 + ... + 4102426543.
It is an arithmetic number, because the mean of its divisors is an integer number (570237251113).
Almost surely, 22272744151641 is an apocalyptic number.
It is an amenable number.
2272744151641 is a deficient number, since it is larger than the sum of its proper divisors (8204852811).
2272744151641 is an equidigital number, since it uses as much as digits as its factorization.
2272744151641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8204852810.
The product of its digits is 752640, while the sum is 46.
The spelling of 2272744151641 in words is "two trillion, two hundred seventy-two billion, seven hundred forty-four million, one hundred fifty-one thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •