Base | Representation |
---|---|
bin | 10001011001001… |
… | …10100100100010 |
3 | 101011112222221221 |
4 | 20230212210202 |
5 | 244323110200 |
6 | 22251205254 |
7 | 3421133506 |
oct | 1054464442 |
9 | 334488857 |
10 | 145910050 |
11 | 753a9420 |
12 | 40a4682a |
13 | 242c9410 |
14 | 15542306 |
15 | cc2291a |
hex | 8b26922 |
145910050 has 48 divisors (see below), whose sum is σ = 318854592. Its totient is φ = 48974400.
The previous prime is 145910047. The next prime is 145910059. The reversal of 145910050 is 50019541.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a junction number, because it is equal to n+sod(n) for n = 145909997 and 145910024.
It is not an unprimeable number, because it can be changed into a prime (145910059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3054 + ... + 17353.
It is an arithmetic number, because the mean of its divisors is an integer number (6642804).
Almost surely, 2145910050 is an apocalyptic number.
145910050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
145910050 is an abundant number, since it is smaller than the sum of its proper divisors (172944542).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145910050 is a wasteful number, since it uses less digits than its factorization.
145910050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20443 (or 20438 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 25.
The square root of 145910050 is about 12079.3232426324. The cubic root of 145910050 is about 526.4555826824.
Adding to 145910050 its reverse (50019541), we get a palindrome (195929591).
The spelling of 145910050 in words is "one hundred forty-five million, nine hundred ten thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •