Base | Representation |
---|---|
bin | 10001010110110… |
… | …11110001110000 |
3 | 101010222102201111 |
4 | 20223123301300 |
5 | 244233304241 |
6 | 22240443104 |
7 | 3415416400 |
oct | 1053336160 |
9 | 333872644 |
10 | 145603696 |
11 | 7520a237 |
12 | 40919494 |
13 | 2421cb44 |
14 | 154a2800 |
15 | cbb1c81 |
hex | 8adbc70 |
145603696 has 60 divisors (see below), whose sum is σ = 330004920. Its totient is φ = 62052480.
The previous prime is 145603687. The next prime is 145603739. The reversal of 145603696 is 696306541.
145603696 is digitally balanced in base 2, 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 11 ways as a sum of consecutive naturals, for example, 179131 + ... + 179941.
It is an arithmetic number, because the mean of its divisors is an integer number (5500082).
Almost surely, 2145603696 is an apocalyptic number.
145603696 is a gapful number since it is divisible by the number (16) 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 145603696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (165002460).
145603696 is an abundant number, since it is smaller than the sum of its proper divisors (184401224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145603696 is a wasteful number, since it uses less digits than its factorization.
145603696 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1062 (or 1049 counting only the distinct ones).
The product of its (nonzero) digits is 116640, while the sum is 40.
The square root of 145603696 is about 12066.6356537355. The cubic root of 145603696 is about 526.0868742861.
The spelling of 145603696 in words is "one hundred forty-five million, six hundred three thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •