Base | Representation |
---|---|
bin | 1111111000101101110… |
… | …1001100000000010011 |
3 | 222002110110001210211001 |
4 | 3332023131030000103 |
5 | 13432421142432034 |
6 | 325213503002431 |
7 | 25501164012253 |
oct | 3761335140023 |
9 | 862413053731 |
10 | 272922624019 |
11 | a5822784a21 |
12 | 44a89299417 |
13 | 1c9760c9146 |
14 | d2d0d1b963 |
15 | 7175442a14 |
hex | 3f8b74c013 |
272922624019 has 2 divisors, whose sum is σ = 272922624020. Its totient is φ = 272922624018.
The previous prime is 272922623947. The next prime is 272922624041. The reversal of 272922624019 is 910426229272.
272922624019 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 272922624019 - 223 = 272914235411 is a prime.
It is a super-2 number, since 2×2729226240192 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 272922624019.
It is not a weakly prime, because it can be changed into another prime (272922624089) 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 as a sum of consecutive naturals, namely, 136461312009 + 136461312010.
It is an arithmetic number, because the mean of its divisors is an integer number (136461312010).
Almost surely, 2272922624019 is an apocalyptic number.
272922624019 is a deficient number, since it is larger than the sum of its proper divisors (1).
272922624019 is an equidigital number, since it uses as much as digits as its factorization.
272922624019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 435456, while the sum is 46.
The spelling of 272922624019 in words is "two hundred seventy-two billion, nine hundred twenty-two million, six hundred twenty-four thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •