Base | Representation |
---|---|
bin | 1011101000011111… |
… | …01100111011000000 |
3 | 121010020112002102011 |
4 | 11310033230323000 |
5 | 100242240144022 |
6 | 2511413102304 |
7 | 310522445200 |
oct | 56417547300 |
9 | 17106462364 |
10 | 6245240512 |
11 | 27153036a5 |
12 | 1263627994 |
13 | 786b32cb4 |
14 | 43360a400 |
15 | 26842b977 |
hex | 1743ecec0 |
6245240512 has 84 divisors (see below), whose sum is σ = 14653010064. Its totient is φ = 2632573440.
The previous prime is 6245240497. The next prime is 6245240537. The reversal of 6245240512 is 2150425426.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 174973 + ... + 207619.
It is an arithmetic number, because the mean of its divisors is an integer number (174440596).
Almost surely, 26245240512 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6245240512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7326505032).
6245240512 is an abundant number, since it is smaller than the sum of its proper divisors (8407769552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6245240512 is a wasteful number, since it uses less digits than its factorization.
6245240512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32734 (or 32717 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 31.
The square root of 6245240512 is about 79026.8341261372. The cubic root of 6245240512 is about 1841.5480544818.
Adding to 6245240512 its reverse (2150425426), we get a palindrome (8395665938).
The spelling of 6245240512 in words is "six billion, two hundred forty-five million, two hundred forty thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •