Base | Representation |
---|---|
bin | 111100011011000100110… |
… | …011111101001001010000 |
3 | 112200221122202210101210110 |
4 | 330123010303331021100 |
5 | 1021012242013041224 |
6 | 12455302441201320 |
7 | 605663246510154 |
oct | 74330463751120 |
9 | 15627582711713 |
10 | 4152240362064 |
11 | 1360a56487a13 |
12 | 570894a90240 |
13 | 24172956bb02 |
14 | 104d80477064 |
15 | 730215ca929 |
hex | 3c6c4cfd250 |
4152240362064 has 20 divisors (see below), whose sum is σ = 10726620935456. Its totient is φ = 1384080120672.
The previous prime is 4152240362047. The next prime is 4152240362069. The reversal of 4152240362064 is 4602630422514.
It is a happy number.
4152240362064 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×41522403620642 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4152240362069) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43252503724 + ... + 43252503819.
Almost surely, 24152240362064 is an apocalyptic number.
It is an amenable number.
4152240362064 is an abundant number, since it is smaller than the sum of its proper divisors (6574380573392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4152240362064 is a wasteful number, since it uses less digits than its factorization.
4152240362064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86505007554 (or 86505007548 counting only the distinct ones).
The product of its (nonzero) digits is 276480, while the sum is 39.
Adding to 4152240362064 its reverse (4602630422514), we get a palindrome (8754870784578).
The spelling of 4152240362064 in words is "four trillion, one hundred fifty-two billion, two hundred forty million, three hundred sixty-two thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •