Base | Representation |
---|---|
bin | 10001010011110… |
… | …01011110111000 |
3 | 101010012222102210 |
4 | 20221321132320 |
5 | 244132413310 |
6 | 22224055120 |
7 | 3412121523 |
oct | 1051713670 |
9 | 333188383 |
10 | 145201080 |
11 | 74a647a2 |
12 | 407644a0 |
13 | 2410b7cb |
14 | 153d9bba |
15 | cb32820 |
hex | 8a797b8 |
145201080 has 128 divisors (see below), whose sum is σ = 466171200. Its totient is φ = 36052992.
The previous prime is 145201051. The next prime is 145201099. The reversal of 145201080 is 80102541.
145201080 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 222034 + ... + 222686.
Almost surely, 2145201080 is an apocalyptic number.
145201080 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 145201080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (233085600).
145201080 is an abundant number, since it is smaller than the sum of its proper divisors (320970120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145201080 is a wasteful number, since it uses less digits than its factorization.
145201080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 793 (or 789 counting only the distinct ones).
The product of its (nonzero) digits is 320, while the sum is 21.
The square root of 145201080 is about 12049.9410786941. The cubic root of 145201080 is about 525.6015236873.
It can be divided in two parts, 14520 and 1080, that multiplied together give a square (15681600 = 39602).
The spelling of 145201080 in words is "one hundred forty-five million, two hundred one thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •