Base | Representation |
---|---|
bin | 101101010001110101001… |
… | …0001100011111001001100 |
3 | 211000220202120111211212100 |
4 | 1122203222101203321030 |
5 | 1303424243014212440 |
6 | 21122454311035100 |
7 | 1211412544503201 |
oct | 132435221437114 |
9 | 24026676454770 |
10 | 6223043116620 |
11 | 1a8a1a5672190 |
12 | 84609866ba90 |
13 | 361aa4656405 |
14 | 1772a83c3ca8 |
15 | abd203d7230 |
hex | 5a8ea463e4c |
6223043116620 has 144 divisors (see below), whose sum is σ = 20593350060192. Its totient is φ = 1508562693120.
The previous prime is 6223043116561. The next prime is 6223043116639. The reversal of 6223043116620 is 266113403226.
6223043116620 is a `hidden beast` number, since 6 + 2 + 23 + 0 + 4 + 3 + 1 + 1 + 6 + 620 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 110323144 + ... + 110379536.
It is an arithmetic number, because the mean of its divisors is an integer number (143009375418).
Almost surely, 26223043116620 is an apocalyptic number.
6223043116620 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
6223043116620 is an abundant number, since it is smaller than the sum of its proper divisors (14370306943572).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6223043116620 is a wasteful number, since it uses less digits than its factorization.
6223043116620 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112152 (or 112147 counting only the distinct ones).
The product of its (nonzero) digits is 62208, while the sum is 36.
Adding to 6223043116620 its reverse (266113403226), we get a palindrome (6489156519846).
The spelling of 6223043116620 in words is "six trillion, two hundred twenty-three billion, forty-three million, one hundred sixteen thousand, six hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •