Base | Representation |
---|---|
bin | 100001011100000100101000… |
… | …000011001110010100101110 |
3 | 201021201020120010011021112222 |
4 | 201130010220003032110232 |
5 | 123234001344130203303 |
6 | 1240440322144355342 |
7 | 42656033024003336 |
oct | 4134045003162456 |
9 | 637636503137488 |
10 | 147064647116078 |
11 | 4294a84836974a |
12 | 145b2144915b52 |
13 | 640a1a149c023 |
14 | 2845d7725a0c6 |
15 | 12007503db938 |
hex | 85c1280ce52e |
147064647116078 has 16 divisors (see below), whose sum is σ = 223328716168320. Its totient is φ = 72622328636856.
The previous prime is 147064647116033. The next prime is 147064647116087. The reversal of 147064647116078 is 870611746460741.
147064647116078 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1470646471160782 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 147064647116078.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 146224850 + ... + 147227157.
It is an arithmetic number, because the mean of its divisors is an integer number (13958044760520).
Almost surely, 2147064647116078 is an apocalyptic number.
147064647116078 is a deficient number, since it is larger than the sum of its proper divisors (76264069052242).
147064647116078 is a wasteful number, since it uses less digits than its factorization.
147064647116078 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 293455111.
The product of its (nonzero) digits is 37933056, while the sum is 62.
The spelling of 147064647116078 in words is "one hundred forty-seven trillion, sixty-four billion, six hundred forty-seven million, one hundred sixteen thousand, seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •