Base | Representation |
---|---|
bin | 1000010110001110… |
… | …0010101111000110 |
3 | 12210011020200210010 |
4 | 2011203202233012 |
5 | 14042103441141 |
6 | 1010201411050 |
7 | 106345345203 |
oct | 20543425706 |
9 | 5704220703 |
10 | 2240687046 |
11 | a4a89a384 |
12 | 526499a86 |
13 | 2992a8b30 |
14 | 17382ccaa |
15 | d1aa7416 |
hex | 858e2bc6 |
2240687046 has 32 divisors (see below), whose sum is σ = 4829690880. Its totient is φ = 688928544.
The previous prime is 2240687041. The next prime is 2240687047. The reversal of 2240687046 is 6407860422.
It is a super-2 number, since 2×22406870462 = 10041356876224412232, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a junction number, because it is equal to n+sod(n) for n = 2240686995 and 2240687013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2240687041) 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, 102261 + ... + 122223.
It is an arithmetic number, because the mean of its divisors is an integer number (150927840).
Almost surely, 22240687046 is an apocalyptic number.
2240687046 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
2240687046 is an abundant number, since it is smaller than the sum of its proper divisors (2589003834).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2240687046 is a wasteful number, since it uses less digits than its factorization.
2240687046 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21420.
The product of its (nonzero) digits is 129024, while the sum is 39.
The square root of 2240687046 is about 47335.8959564515. The cubic root of 2240687046 is about 1308.5602826048.
The spelling of 2240687046 in words is "two billion, two hundred forty million, six hundred eighty-seven thousand, forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •