Base | Representation |
---|---|
bin | 1000001011100110… |
… | …1101101100100100 |
3 | 12200001110212101120 |
4 | 2002321231230210 |
5 | 13444204324320 |
6 | 1001531253540 |
7 | 105265054404 |
oct | 20271555444 |
9 | 5601425346 |
10 | 2196167460 |
11 | a27752133 |
12 | 5135aa2b0 |
13 | 28ccbc096 |
14 | 16b960804 |
15 | ccc11440 |
hex | 82e6db24 |
2196167460 has 96 divisors (see below), whose sum is σ = 6339053952. Its totient is φ = 567751680.
The previous prime is 2196167453. The next prime is 2196167461. The reversal of 2196167460 is 647616912.
It is not an unprimeable number, because it can be changed into a prime (2196167461) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 398242 + ... + 403718.
It is an arithmetic number, because the mean of its divisors is an integer number (66031812).
Almost surely, 22196167460 is an apocalyptic number.
2196167460 is a gapful number since it is divisible by the number (20) 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 2196167460, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3169526976).
2196167460 is an abundant number, since it is smaller than the sum of its proper divisors (4142886492).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2196167460 is a wasteful number, since it uses less digits than its factorization.
2196167460 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5693 (or 5691 counting only the distinct ones).
The product of its (nonzero) digits is 108864, while the sum is 42.
The square root of 2196167460 is about 46863.2847760376. The cubic root of 2196167460 is about 1299.8357701806.
The spelling of 2196167460 in words is "two billion, one hundred ninety-six million, one hundred sixty-seven thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •