Base | Representation |
---|---|
bin | 100001001000010010001000… |
… | …111001110100000010101010 |
3 | 201002220020110202120101200011 |
4 | 201020102020321310002222 |
5 | 123044211330424000000 |
6 | 1233515502431002134 |
7 | 42455551652124313 |
oct | 4110221071640252 |
9 | 632806422511604 |
10 | 145704767406250 |
11 | 4247605475a268 |
12 | 1441268796934a |
13 | 633bb92843730 |
14 | 27da2111b160a |
15 | 11ca1ae5c52ba |
hex | 848488e740aa |
145704767406250 has 112 divisors (see below), whose sum is σ = 309692420261280. Its totient is φ = 50967171000000.
The previous prime is 145704767406241. The next prime is 145704767406251. The reversal of 145704767406250 is 52604767407541.
It is not an unprimeable number, because it can be changed into a prime (145704767406251) by changing a digit.
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 55 ways as a sum of consecutive naturals, for example, 1719616 + ... + 17157115.
It is an arithmetic number, because the mean of its divisors is an integer number (2765110895190).
Almost surely, 2145704767406250 is an apocalyptic number.
145704767406250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
145704767406250 is an abundant number, since it is smaller than the sum of its proper divisors (163987652855030).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145704767406250 is an equidigital number, since it uses as much as digits as its factorization.
145704767406250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18876795 (or 18876770 counting only the distinct ones).
The product of its (nonzero) digits is 39513600, while the sum is 58.
The spelling of 145704767406250 in words is "one hundred forty-five trillion, seven hundred four billion, seven hundred sixty-seven million, four hundred six thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.454 sec. • engine limits •