Base | Representation |
---|---|
bin | 10000010101001… |
… | …110100010111110 |
3 | 201002120122102110 |
4 | 100111032202332 |
5 | 1030121000222 |
6 | 43104434450 |
7 | 6534651000 |
oct | 2025164276 |
9 | 632518373 |
10 | 274000062 |
11 | 130736336 |
12 | 77918a26 |
13 | 449c671b |
14 | 28566370 |
15 | 190c530c |
hex | 1054e8be |
274000062 has 64 divisors (see below), whose sum is σ = 661248000. Its totient is φ = 75569760.
The previous prime is 274000049. The next prime is 274000079. The reversal of 274000062 is 260000472.
It is a happy number.
274000062 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 57387 + ... + 61977.
It is an arithmetic number, because the mean of its divisors is an integer number (10332000).
Almost surely, 2274000062 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 274000062, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (330624000).
274000062 is an abundant number, since it is smaller than the sum of its proper divisors (387247938).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
274000062 is a wasteful number, since it uses less digits than its factorization.
274000062 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4646 (or 4632 counting only the distinct ones).
The product of its (nonzero) digits is 672, while the sum is 21.
The square root of 274000062 is about 16552.9472300252. The cubic root of 274000062 is about 649.5065778008.
The spelling of 274000062 in words is "two hundred seventy-four million, sixty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •