Base | Representation |
---|---|
bin | 1011011001000101… |
… | …10110100101110000 |
3 | 120210020102011220120 |
4 | 11230202312211300 |
5 | 100011201334440 |
6 | 2450520010240 |
7 | 304363336335 |
oct | 55442664560 |
9 | 16706364816 |
10 | 6116043120 |
11 | 265938a7a0 |
12 | 1228300980 |
13 | 766138935 |
14 | 4203b898c |
15 | 25be0add0 |
hex | 16c8b6970 |
6116043120 has 160 divisors (see below), whose sum is σ = 21074079744. Its totient is φ = 1454668800.
The previous prime is 6116043113. The next prime is 6116043203. The reversal of 6116043120 is 213406116.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 118065 + ... + 161775.
Almost surely, 26116043120 is an apocalyptic number.
6116043120 is a gapful number since it is divisible by the number (60) 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 6116043120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10537039872).
6116043120 is an abundant number, since it is smaller than the sum of its proper divisors (14958036624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6116043120 is a wasteful number, since it uses less digits than its factorization.
6116043120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43791 (or 43785 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 24.
The square root of 6116043120 is about 78205.1348697769. The cubic root of 6116043120 is about 1828.7605570050.
Adding to 6116043120 its reverse (213406116), we get a palindrome (6329449236).
The spelling of 6116043120 in words is "six billion, one hundred sixteen million, forty-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •