Base | Representation |
---|---|
bin | 1000011101000111000… |
… | …0010110000011001100 |
3 | 111212220221012120011010 |
4 | 2013101300112003030 |
5 | 4334434234012030 |
6 | 150421152325220 |
7 | 13331335254546 |
oct | 2072160260314 |
9 | 455827176133 |
10 | 145253032140 |
11 | 56668605a17 |
12 | 24198b43810 |
13 | 1090ac85438 |
14 | 705d158696 |
15 | 3ba1eaa6b0 |
hex | 21d1c160cc |
145253032140 has 48 divisors (see below), whose sum is σ = 408955528800. Its totient is φ = 38520138240.
The previous prime is 145253032123. The next prime is 145253032147. The reversal of 145253032140 is 41230352541.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 145253032098 and 145253032107.
It is not an unprimeable number, because it can be changed into a prime (145253032147) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6676665 + ... + 6698384.
It is an arithmetic number, because the mean of its divisors is an integer number (8519906850).
Almost surely, 2145253032140 is an apocalyptic number.
145253032140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
145253032140 is an abundant number, since it is smaller than the sum of its proper divisors (263702496660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145253032140 is a wasteful number, since it uses less digits than its factorization.
145253032140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13375242 (or 13375240 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 30.
Adding to 145253032140 its reverse (41230352541), we get a palindrome (186483384681).
The spelling of 145253032140 in words is "one hundred forty-five billion, two hundred fifty-three million, thirty-two thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •