Base | Representation |
---|---|
bin | 1000101100101010001100110… |
… | …0001000100101000100001000 |
3 | 2222021002201220212221120101001 |
4 | 2023022203030020211010020 |
5 | 1120210340423223201331 |
6 | 10005421245400304344 |
7 | 242630254630616611 |
oct | 21312431410450410 |
9 | 2867081825846331 |
10 | 612053444350216 |
11 | 168023454154120 |
12 | 587900841720b4 |
13 | 2036951371c97b |
14 | ab1d78abb0c08 |
15 | 4ab5dac04b561 |
hex | 22ca8cc225108 |
612053444350216 has 64 divisors (see below), whose sum is σ = 1252318887907200. Its totient is φ = 278119145049600.
The previous prime is 612053444350163. The next prime is 612053444350217.
612053444350216 is nontrivially palindromic in base 10.
It is a super-4 number, since 4×6120534443502164 (a number of 60 digits) contains 4444 as substring.
It is not an unprimeable number, because it can be changed into a prime (612053444350217) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 6737588956 + ... + 6737679796.
It is an arithmetic number, because the mean of its divisors is an integer number (19567482623550).
Almost surely, 2612053444350216 is an apocalyptic number.
It is an amenable number.
612053444350216 is an abundant number, since it is smaller than the sum of its proper divisors (640265443556984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
612053444350216 is a wasteful number, since it uses less digits than its factorization.
612053444350216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113950 (or 113946 counting only the distinct ones).
The product of its (nonzero) digits is 2073600, while the sum is 46.
The spelling of 612053444350216 in words is "six hundred twelve trillion, fifty-three billion, four hundred forty-four million, three hundred fifty thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •