Base | Representation |
---|---|
bin | 1011111100100000… |
… | …00101011100111010 |
3 | 121112221101220101010 |
4 | 11332100011130322 |
5 | 101113224110041 |
6 | 2540211134350 |
7 | 314631363606 |
oct | 57620053472 |
9 | 17487356333 |
10 | 6413113146 |
11 | 27a1042910 |
12 | 12ab8a43b6 |
13 | 7b284bc0b |
14 | 44ba28506 |
15 | 27803ba16 |
hex | 17e40573a |
6413113146 has 16 divisors (see below), whose sum is σ = 13992247008. Its totient is φ = 1943367600.
The previous prime is 6413113129. The next prime is 6413113151.
6413113146 is nontrivially palindromic in base 10.
It is a super-2 number, since 2×64131131462 = 82256040446796034632, which contains 22 as substring.
It is a Curzon number.
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 7 ways as a sum of consecutive naturals, for example, 48584125 + ... + 48584256.
It is an arithmetic number, because the mean of its divisors is an integer number (874515438).
Almost surely, 26413113146 is an apocalyptic number.
6413113146 is a gapful number since it is divisible by the number (66) formed by its first and last digit.
6413113146 is an abundant number, since it is smaller than the sum of its proper divisors (7579133862).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6413113146 is a wasteful number, since it uses less digits than its factorization.
6413113146 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97168397.
The product of its digits is 5184, while the sum is 30.
The square root of 6413113146 is about 80081.9152243501. The cubic root of 6413113146 is about 1857.9027065571.
It can be divided in two parts, 64131 and 13146, that added together give a palindrome (77277).
The spelling of 6413113146 in words is "six billion, four hundred thirteen million, one hundred thirteen thousand, one hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •