Base | Representation |
---|---|
bin | 10000010101010… |
… | …001001111110000 |
3 | 201002121012121000 |
4 | 100111101033300 |
5 | 1030121323440 |
6 | 43105002000 |
7 | 6535025145 |
oct | 2025211760 |
9 | 632535530 |
10 | 274011120 |
11 | 130743679 |
12 | 77923300 |
13 | 449cb776 |
14 | 2856a3cc |
15 | 190c8730 |
hex | 105513f0 |
274011120 has 80 divisors (see below), whose sum is σ = 943823520. Its totient is φ = 73069056.
The previous prime is 274011107. The next prime is 274011131. The reversal of 274011120 is 21110472.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 274011093 and 274011102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 61269 + ... + 65588.
It is an arithmetic number, because the mean of its divisors is an integer number (11797794).
Almost surely, 2274011120 is an apocalyptic number.
274011120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
274011120 is an abundant number, since it is smaller than the sum of its proper divisors (669812400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
274011120 is a wasteful number, since it uses less digits than its factorization.
274011120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 126879 (or 126867 counting only the distinct ones).
The product of its (nonzero) digits is 112, while the sum is 18.
The square root of 274011120 is about 16553.2812457229. The cubic root of 274011120 is about 649.5153152040.
Adding to 274011120 its reverse (21110472), we get a palindrome (295121592).
The spelling of 274011120 in words is "two hundred seventy-four million, eleven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •