Base | Representation |
---|---|
bin | 1000011100111111001… |
… | …1010110010000110100 |
3 | 111212211122112211002210 |
4 | 2013033303112100310 |
5 | 4334402341440022 |
6 | 150414022133420 |
7 | 13330456612554 |
oct | 2071763262064 |
9 | 455748484083 |
10 | 145220265012 |
11 | 56651065549 |
12 | 24189b81270 |
13 | 10904251ac4 |
14 | 7058a69164 |
15 | 3b9e186a0c |
hex | 21cfcd6434 |
145220265012 has 24 divisors (see below), whose sum is σ = 341285039200. Its totient is φ = 48058504416.
The previous prime is 145220264977. The next prime is 145220265023. The reversal of 145220265012 is 210562022541.
145220265012 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×1452202650122 (a number of 23 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 7 ways as a sum of consecutive naturals, for example, 43529587 + ... + 43532922.
Almost surely, 2145220265012 is an apocalyptic number.
145220265012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
145220265012 is an abundant number, since it is smaller than the sum of its proper divisors (196064774188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145220265012 is a wasteful number, since it uses less digits than its factorization.
145220265012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87062655 (or 87062653 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 30.
Adding to 145220265012 its reverse (210562022541), we get a palindrome (355782287553).
The spelling of 145220265012 in words is "one hundred forty-five billion, two hundred twenty million, two hundred sixty-five thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •