Base | Representation |
---|---|
bin | 100000011101011111000… |
… | …000111100101010110000 |
3 | 21220020210001221020201122 |
4 | 200131133000330222300 |
5 | 243021414110020030 |
6 | 4424432231121412 |
7 | 320106245043464 |
oct | 40353700745260 |
9 | 7806701836648 |
10 | 2230682110640 |
11 | 790032996915 |
12 | 3003a2b13268 |
13 | 1324773631a9 |
14 | 79d738184a4 |
15 | 3d059db78e5 |
hex | 2075f03cab0 |
2230682110640 has 80 divisors (see below), whose sum is σ = 5418139216896. Its totient is φ = 853086278400.
The previous prime is 2230682110639. The next prime is 2230682110693. The reversal of 2230682110640 is 460112860322.
It is a tau number, because it is divible by the number of its divisors (80).
It is a self number, because there is not a number n which added to its sum of digits gives 2230682110640.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5212646 + ... + 5624325.
Almost surely, 22230682110640 is an apocalyptic number.
2230682110640 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2230682110640 is an abundant number, since it is smaller than the sum of its proper divisors (3187457106256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2230682110640 is a wasteful number, since it uses less digits than its factorization.
2230682110640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10837098 (or 10837092 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 35.
Adding to 2230682110640 its reverse (460112860322), we get a palindrome (2690794970962).
The spelling of 2230682110640 in words is "two trillion, two hundred thirty billion, six hundred eighty-two million, one hundred ten thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •