Base | Representation |
---|---|
bin | 10001010011000… |
… | …11111010010000 |
3 | 101010001111020012 |
4 | 20221203322100 |
5 | 244122101340 |
6 | 22222134052 |
7 | 3411303104 |
oct | 1051437220 |
9 | 333044205 |
10 | 145112720 |
11 | 74a04375 |
12 | 40721328 |
13 | 240aa51c |
14 | 153b5904 |
15 | cb16565 |
hex | 8a63e90 |
145112720 has 60 divisors (see below), whose sum is σ = 342710580. Its totient is φ = 57142272.
The previous prime is 145112707. The next prime is 145112771. The reversal of 145112720 is 27211541.
It can be written as a sum of positive squares in 6 ways, for example, as 2930944 + 142181776 = 1712^2 + 11924^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 633566 + ... + 633794.
It is an arithmetic number, because the mean of its divisors is an integer number (5711843).
Almost surely, 2145112720 is an apocalyptic number.
145112720 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 145112720, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (171355290).
145112720 is an abundant number, since it is smaller than the sum of its proper divisors (197597860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145112720 is an equidigital number, since it uses as much as digits as its factorization.
145112720 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 420 (or 325 counting only the distinct ones).
The product of its (nonzero) digits is 560, while the sum is 23.
The square root of 145112720 is about 12046.2741127703. The cubic root of 145112720 is about 525.4948863391.
The spelling of 145112720 in words is "one hundred forty-five million, one hundred twelve thousand, seven hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •