Base | Representation |
---|---|
bin | 10000010110000… |
… | …101001111100101 |
3 | 201010000000202012 |
4 | 100112011033211 |
5 | 1030200132401 |
6 | 43113324005 |
7 | 6536603114 |
oct | 2026051745 |
9 | 633000665 |
10 | 274224101 |
11 | 130879698 |
12 | 77a06605 |
13 | 44a746a8 |
14 | 285c3c7b |
15 | 1911b8bb |
hex | 105853e5 |
274224101 has 8 divisors (see below), whose sum is σ = 286327104. Its totient is φ = 262136160.
The previous prime is 274224091. The next prime is 274224107. The reversal of 274224101 is 101422472.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-274224101 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (274224107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 49850 + ... + 55076.
It is an arithmetic number, because the mean of its divisors is an integer number (35790888).
Almost surely, 2274224101 is an apocalyptic number.
It is an amenable number.
274224101 is a deficient number, since it is larger than the sum of its proper divisors (12103003).
274224101 is a wasteful number, since it uses less digits than its factorization.
274224101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7531.
The product of its (nonzero) digits is 896, while the sum is 23.
The square root of 274224101 is about 16559.7131919608. The cubic root of 274224101 is about 649.6835548430.
Adding to 274224101 its reverse (101422472), we get a palindrome (375646573).
The spelling of 274224101 in words is "two hundred seventy-four million, two hundred twenty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •