Base | Representation |
---|---|
bin | 1000101000011001… |
… | …0100000111000000 |
3 | 12222110200021110000 |
4 | 2022012110013000 |
5 | 14221112123130 |
6 | 1021523240000 |
7 | 111262263453 |
oct | 21206240700 |
9 | 5873607400 |
10 | 2316911040 |
11 | a89921614 |
12 | 547b19000 |
13 | 2ac0165a2 |
14 | 17d9d149a |
15 | d8612260 |
hex | 8a1941c0 |
2316911040 has 140 divisors (see below), whose sum is σ = 8241752376. Its totient is φ = 617836032.
The previous prime is 2316910997. The next prime is 2316911071. The reversal of 2316911040 is 401196132.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 2316910995 and 2316911013.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 18774 + ... + 70613.
Almost surely, 22316911040 is an apocalyptic number.
2316911040 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 2316911040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4120876188).
2316911040 is an abundant number, since it is smaller than the sum of its proper divisors (5924841336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2316911040 is an equidigital number, since it uses as much as digits as its factorization.
2316911040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 89416 (or 89397 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 27.
The square root of 2316911040 is about 48134.3021139810. The cubic root of 2316911040 is about 1323.2333955087.
The spelling of 2316911040 in words is "two billion, three hundred sixteen million, nine hundred eleven thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •