Base | Representation |
---|---|
bin | 100001000010101100010000… |
… | …111000010010101001011110 |
3 | 201001112111121121202112021020 |
4 | 201002230100320102221132 |
5 | 123021412341410331222 |
6 | 1233023152234145010 |
7 | 42416026334115132 |
oct | 4102542070225136 |
9 | 631474547675236 |
10 | 145320501652062 |
11 | 42338095759700 |
12 | 14370105b82166 |
13 | 6311883bc1219 |
14 | 27c579a9633c2 |
15 | 11c01be1ca65c |
hex | 842b10e12a5e |
145320501652062 has 48 divisors (see below), whose sum is σ = 319467355376400. Its totient is φ = 44036177806720.
The previous prime is 145320501652033. The next prime is 145320501652129. The reversal of 145320501652062 is 260256105023541.
It is a super-2 number, since 2×1453205016520622 (a number of 29 digits) contains 22 as substring.
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 23 ways as a sum of consecutive naturals, for example, 103712314 + ... + 105104162.
It is an arithmetic number, because the mean of its divisors is an integer number (6655569903675).
Almost surely, 2145320501652062 is an apocalyptic number.
145320501652062 is an abundant number, since it is smaller than the sum of its proper divisors (174146853724338).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145320501652062 is a wasteful number, since it uses less digits than its factorization.
145320501652062 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1535689 (or 1535678 counting only the distinct ones).
The product of its (nonzero) digits is 432000, while the sum is 42.
The spelling of 145320501652062 in words is "one hundred forty-five trillion, three hundred twenty billion, five hundred one million, six hundred fifty-two thousand, sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •