Base | Representation |
---|---|
bin | 1011011100111110… |
… | …10000001100010000 |
3 | 120212111202222102000 |
4 | 11232133100030100 |
5 | 100043023410330 |
6 | 2454042554000 |
7 | 305240460330 |
oct | 55637201420 |
9 | 16774688360 |
10 | 6148653840 |
11 | 26758336aa |
12 | 1237208900 |
13 | 76cb16014 |
14 | 4248670c0 |
15 | 25ebed560 |
hex | 16e7d0310 |
6148653840 has 640 divisors, whose sum is σ = 26998272000. Its totient is φ = 1252122624.
The previous prime is 6148653839. The next prime is 6148653869. The reversal of 6148653840 is 483568416.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 4883131 + ... + 4884389.
It is an arithmetic number, because the mean of its divisors is an integer number (42184800).
Almost surely, 26148653840 is an apocalyptic number.
6148653840 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 6148653840, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13499136000).
6148653840 is an abundant number, since it is smaller than the sum of its proper divisors (20849618160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6148653840 is a wasteful number, since it uses less digits than its factorization.
6148653840 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1324 (or 1312 counting only the distinct ones).
The product of its (nonzero) digits is 552960, while the sum is 45.
The square root of 6148653840 is about 78413.3524343909. The cubic root of 6148653840 is about 1832.0051120800.
The spelling of 6148653840 in words is "six billion, one hundred forty-eight million, six hundred fifty-three thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •