Base | Representation |
---|---|
bin | 1110110011001111001… |
… | …1111000111110100001 |
3 | 220022022200012202022110 |
4 | 3230303303320332201 |
5 | 13131222202424301 |
6 | 312451110025533 |
7 | 24241050661356 |
oct | 3546363707641 |
9 | 808280182273 |
10 | 254272311201 |
11 | 989220aa957 |
12 | 413433482a9 |
13 | 1ac9323539c |
14 | c441dac62d |
15 | 6932e2e0d6 |
hex | 3b33cf8fa1 |
254272311201 has 8 divisors (see below), whose sum is σ = 342524900704. Its totient is φ = 167767297920.
The previous prime is 254272311197. The next prime is 254272311239. The reversal of 254272311201 is 102113272452.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 254272311201 - 22 = 254272311197 is a prime.
It is a super-4 number, since 4×2542723112014 (a number of 47 digits) contains 4444 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (254272311101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 436893715 + ... + 436894296.
It is an arithmetic number, because the mean of its divisors is an integer number (42815612588).
Almost surely, 2254272311201 is an apocalyptic number.
It is an amenable number.
254272311201 is a deficient number, since it is larger than the sum of its proper divisors (88252589503).
254272311201 is an equidigital number, since it uses as much as digits as its factorization.
254272311201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 873788111.
The product of its (nonzero) digits is 6720, while the sum is 30.
Adding to 254272311201 its reverse (102113272452), we get a palindrome (356385583653).
The spelling of 254272311201 in words is "two hundred fifty-four billion, two hundred seventy-two million, three hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •