Base | Representation |
---|---|
bin | 1000000000000000100… |
… | …00000000000000000001 |
3 | 222021112000011120020210 |
4 | 10000000100000000001 |
5 | 14000424304214444 |
6 | 330140141224333 |
7 | 25600556211000 |
oct | 4000020000001 |
9 | 867460146223 |
10 | 274882101249 |
11 | a6638864198 |
12 | 453355620a9 |
13 | 1cbc9055a22 |
14 | d439268c37 |
15 | 723c49d7b9 |
hex | 4000400001 |
274882101249 has 16 divisors (see below), whose sum is σ = 427416291200. Its totient is φ = 157075485840.
The previous prime is 274882101203. The next prime is 274882101257. The reversal of 274882101249 is 942101288472.
It is not a de Polignac number, because 274882101249 - 216 = 274882035713 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 274882101198 and 274882101207.
It is not an unprimeable number, because it can be changed into a prime (274882101649) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (3) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 133566562 + ... + 133568619.
It is an arithmetic number, because the mean of its divisors is an integer number (26713518200).
It is a Proth number, since it is equal to 65537 ⋅ 222 + 1 and 65537 < 222.
Almost surely, 2274882101249 is an apocalyptic number.
It is an amenable number.
274882101249 is a deficient number, since it is larger than the sum of its proper divisors (152534189951).
274882101249 is an equidigital number, since it uses as much as digits as its factorization.
274882101249 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 267135205 (or 267135191 counting only the distinct ones).
The product of its (nonzero) digits is 516096, while the sum is 48.
The spelling of 274882101249 in words is "two hundred seventy-four billion, eight hundred eighty-two million, one hundred one thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •