Base | Representation |
---|---|
bin | 111100011011000… |
… | …0110111100000000 |
3 | 12020022000010200220 |
4 | 1320312012330000 |
5 | 13123011400422 |
6 | 533103143040 |
7 | 101146020162 |
oct | 17066067400 |
9 | 5208003626 |
10 | 2027450112 |
11 | 950496306 |
12 | 486ba4a80 |
13 | 26406882c |
14 | 1533a2932 |
15 | bced5e5c |
hex | 78d86f00 |
2027450112 has 72 divisors (see below), whose sum is σ = 5404622160. Its totient is φ = 674734080.
The previous prime is 2027450093. The next prime is 2027450143. The reversal of 2027450112 is 2110547202.
It is a super-2 number, since 2×20274501122 = 8221107913297625088, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 582714 + ... + 586182.
Almost surely, 22027450112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2027450112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2702311080).
2027450112 is an abundant number, since it is smaller than the sum of its proper divisors (3377172048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2027450112 is an equidigital number, since it uses as much as digits as its factorization.
2027450112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4249 (or 4235 counting only the distinct ones).
The product of its (nonzero) digits is 1120, while the sum is 24.
The square root of 2027450112 is about 45027.2152370097. The cubic root of 2027450112 is about 1265.6590403257.
Adding to 2027450112 its reverse (2110547202), we get a palindrome (4137997314).
The spelling of 2027450112 in words is "two billion, twenty-seven million, four hundred fifty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •