Base | Representation |
---|---|
bin | 111100011010010… |
… | …1001010001100100 |
3 | 12020021021122102212 |
4 | 1320310221101210 |
5 | 13122412111333 |
6 | 533051022552 |
7 | 101142531530 |
oct | 17064512144 |
9 | 5207248385 |
10 | 2027066468 |
11 | 950254049 |
12 | 486a3aa58 |
13 | 263c6301b |
14 | 153302bc0 |
15 | bce5c448 |
hex | 78d29464 |
2027066468 has 48 divisors (see below), whose sum is σ = 4323634560. Its totient is φ = 811731456.
The previous prime is 2027066467. The next prime is 2027066491. The reversal of 2027066468 is 8646607202.
It is not an unprimeable number, because it can be changed into a prime (2027066467) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 50846 + ... + 81482.
It is an arithmetic number, because the mean of its divisors is an integer number (90075720).
Almost surely, 22027066468 is an apocalyptic number.
2027066468 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2027066468, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2161817280).
2027066468 is an abundant number, since it is smaller than the sum of its proper divisors (2296568092).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2027066468 is a wasteful number, since it uses less digits than its factorization.
2027066468 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30804 (or 30802 counting only the distinct ones).
The product of its (nonzero) digits is 193536, while the sum is 41.
The square root of 2027066468 is about 45022.9549008059. The cubic root of 2027066468 is about 1265.5792038973.
The spelling of 2027066468 in words is "two billion, twenty-seven million, sixty-six thousand, four hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •