Base | Representation |
---|---|
bin | 1011011010110010… |
… | …11001110010111100 |
3 | 120211020022200210110 |
4 | 11231121121302330 |
5 | 100023331434400 |
6 | 2452150310020 |
7 | 304626025260 |
oct | 55531316274 |
9 | 16736280713 |
10 | 6130343100 |
11 | 2666467562 |
12 | 1231058310 |
13 | 7690a476b |
14 | 42225c0a0 |
15 | 25d2d2e50 |
hex | 16d659cbc |
6130343100 has 72 divisors (see below), whose sum is σ = 20271008128. Its totient is φ = 1401220800.
The previous prime is 6130343099. The next prime is 6130343137. The reversal of 6130343100 is 13430316.
It is a super-2 number, since 2×61303431002 = 75162213047435220000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
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 23 ways as a sum of consecutive naturals, for example, 1457506 + ... + 1461705.
Almost surely, 26130343100 is an apocalyptic number.
6130343100 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
6130343100 is an abundant number, since it is smaller than the sum of its proper divisors (14140665028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6130343100 is a wasteful number, since it uses less digits than its factorization.
6130343100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2919235 (or 2919228 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
The square root of 6130343100 is about 78296.5075849492. The cubic root of 6130343100 is about 1830.1847285825.
Adding to 6130343100 its reverse (13430316), we get a palindrome (6143773416).
The spelling of 6130343100 in words is "six billion, one hundred thirty million, three hundred forty-three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •