Base | Representation |
---|---|
bin | 1011111100011000… |
… | …10111110111111000 |
3 | 121112212120110111120 |
4 | 11332030113313320 |
5 | 101113001440044 |
6 | 2540134225240 |
7 | 314620201533 |
oct | 57614276770 |
9 | 17485513446 |
10 | 6412140024 |
11 | 27a0538784 |
12 | 12ab4b5220 |
13 | 7b259acc4 |
14 | 44b853a1a |
15 | 277de8519 |
hex | 17e317df8 |
6412140024 has 32 divisors (see below), whose sum is σ = 16044203520. Its totient is φ = 2135532896.
The previous prime is 6412140023. The next prime is 6412140043. The reversal of 6412140024 is 4200412146.
It is a happy number.
It is a super-2 number, since 2×64121400242 = 82231079374765441152, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 6412139976 and 6412140003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6412140023) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 86952 + ... + 142775.
It is an arithmetic number, because the mean of its divisors is an integer number (501381360).
Almost surely, 26412140024 is an apocalyptic number.
It is an amenable number.
6412140024 is an abundant number, since it is smaller than the sum of its proper divisors (9632063496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6412140024 is a wasteful number, since it uses less digits than its factorization.
6412140024 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 230899 (or 230895 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 24.
The square root of 6412140024 is about 80075.8392025959. The cubic root of 6412140024 is about 1857.8087294506.
The spelling of 6412140024 in words is "six billion, four hundred twelve million, one hundred forty thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •