Base | Representation |
---|---|
bin | 1000011100100101100… |
… | …0000101011111100100 |
3 | 111212120010200111202120 |
4 | 2013021120011133210 |
5 | 4334142242031030 |
6 | 150355211305540 |
7 | 13325010342222 |
oct | 2071130053744 |
9 | 455503614676 |
10 | 145112455140 |
11 | 565a621a384 |
12 | 24159a4b2b0 |
13 | 108b7b05593 |
14 | 7048603b12 |
15 | 3b9498d010 |
hex | 21c96057e4 |
145112455140 has 144 divisors (see below), whose sum is σ = 438453367296. Its totient is φ = 35819942400.
The previous prime is 145112455133. The next prime is 145112455151. The reversal of 145112455140 is 41554211541.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 910200 + ... + 1057680.
Almost surely, 2145112455140 is an apocalyptic number.
145112455140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 145112455140, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (219226683648).
145112455140 is an abundant number, since it is smaller than the sum of its proper divisors (293340912156).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145112455140 is a wasteful number, since it uses less digits than its factorization.
145112455140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147570 (or 147545 counting only the distinct ones).
The product of its (nonzero) digits is 16000, while the sum is 33.
Adding to 145112455140 its reverse (41554211541), we get a palindrome (186666666681).
The spelling of 145112455140 in words is "one hundred forty-five billion, one hundred twelve million, four hundred fifty-five thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •