Base | Representation |
---|---|
bin | 1000101000010100… |
… | …1111100001000000 |
3 | 12222110011000001002 |
4 | 2022011033201000 |
5 | 14221024130310 |
6 | 1021513231132 |
7 | 111260013362 |
oct | 21205174100 |
9 | 5873130032 |
10 | 2316630080 |
11 | a8974a516 |
12 | 547a024a8 |
13 | 2abc4873b |
14 | 17d95ad32 |
15 | d85a8da5 |
hex | 8a14f840 |
2316630080 has 28 divisors (see below), whose sum is σ = 5516476140. Its totient is φ = 926651904.
The previous prime is 2316630079. The next prime is 2316630089. The reversal of 2316630080 is 800366132.
It can be written as a sum of positive squares in 2 ways, for example, as 280093696 + 2036536384 = 16736^2 + 45128^2 .
It is not an unprimeable number, because it can be changed into a prime (2316630089) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3619415 + ... + 3620054.
It is an arithmetic number, because the mean of its divisors is an integer number (197017005).
Almost surely, 22316630080 is an apocalyptic number.
2316630080 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2316630080 is an abundant number, since it is smaller than the sum of its proper divisors (3199846060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2316630080 is an equidigital number, since it uses as much as digits as its factorization.
2316630080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7239486 (or 7239476 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 29.
The square root of 2316630080 is about 48131.3835246817. The cubic root of 2316630080 is about 1323.1799060887.
The spelling of 2316630080 in words is "two billion, three hundred sixteen million, six hundred thirty thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.374 sec. • engine limits •