Base | Representation |
---|---|
bin | 100111101010001010011… |
… | …001100001001100001101 |
3 | 100122112120000111002121210 |
4 | 213222022121201030031 |
5 | 324122434242223041 |
6 | 5443555550045033 |
7 | 400620151033536 |
oct | 47521231411415 |
9 | 10575500432553 |
10 | 2725331211021 |
11 | 960896468221 |
12 | 38022baa9779 |
13 | 169cc7a42873 |
14 | 95c9a11768d |
15 | 4ad5ad7e016 |
hex | 27a8a66130d |
2725331211021 has 16 divisors (see below), whose sum is σ = 3648397515840. Its totient is φ = 1809576768000.
The previous prime is 2725331211011. The next prime is 2725331211041. The reversal of 2725331211021 is 1201121335272.
It is not a de Polignac number, because 2725331211021 - 29 = 2725331210509 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2725331211021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2725331211011) 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 15 ways as a sum of consecutive naturals, for example, 24305875 + ... + 24417743.
It is an arithmetic number, because the mean of its divisors is an integer number (228024844740).
Almost surely, 22725331211021 is an apocalyptic number.
It is an amenable number.
2725331211021 is a deficient number, since it is larger than the sum of its proper divisors (923066304819).
2725331211021 is a wasteful number, since it uses less digits than its factorization.
2725331211021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144476.
The product of its (nonzero) digits is 5040, while the sum is 30.
Adding to 2725331211021 its reverse (1201121335272), we get a palindrome (3926452546293).
The spelling of 2725331211021 in words is "two trillion, seven hundred twenty-five billion, three hundred thirty-one million, two hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •