Base | Representation |
---|---|
bin | 100001010101101010110101… |
… | …101010011110111000001000 |
3 | 201020011011211100201002221220 |
4 | 201111222311222132320020 |
5 | 123204244231142112324 |
6 | 1235502232542202040 |
7 | 42612165204552135 |
oct | 4125526552367010 |
9 | 636134740632856 |
10 | 146624641363464 |
11 | 427a018560a290 |
12 | 14540a07883320 |
13 | 63a784b845c24 |
14 | 282c955c2d58c |
15 | 11e409b771b79 |
hex | 855ab5a9ee08 |
146624641363464 has 64 divisors (see below), whose sum is σ = 400423589821440. Its totient is φ = 44371909028160.
The previous prime is 146624641363457. The next prime is 146624641363477. The reversal of 146624641363464 is 464363146426641.
It is a nude number because it is divisible by every one of its digits.
It is a junction number, because it is equal to n+sod(n) for n = 146624641363398 and 146624641363407.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 373556452 + ... + 373948755.
It is an arithmetic number, because the mean of its divisors is an integer number (6256618590960).
Almost surely, 2146624641363464 is an apocalyptic number.
It is an amenable number.
146624641363464 is an abundant number, since it is smaller than the sum of its proper divisors (253798948457976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146624641363464 is a wasteful number, since it uses less digits than its factorization.
146624641363464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 747505970 (or 747505966 counting only the distinct ones).
The product of its digits is 143327232, while the sum is 60.
The spelling of 146624641363464 in words is "one hundred forty-six trillion, six hundred twenty-four billion, six hundred forty-one million, three hundred sixty-three thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •