Base | Representation |
---|---|
bin | 10001010111100… |
… | …01010111110000 |
3 | 101011010221001100 |
4 | 20223301113300 |
5 | 244244122034 |
6 | 22242404400 |
7 | 3416235303 |
oct | 1053612760 |
9 | 334127040 |
10 | 145692144 |
11 | 7526a734 |
12 | 40960700 |
13 | 24251190 |
14 | 154c6b3a |
15 | cbcd099 |
hex | 8af15f0 |
145692144 has 120 divisors (see below), whose sum is σ = 442332800. Its totient is φ = 44499456.
The previous prime is 145692139. The next prime is 145692187. The reversal of 145692144 is 441296541.
145692144 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 145692099 and 145692108.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 417282 + ... + 417630.
Almost surely, 2145692144 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 145692144, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (221166400).
145692144 is an abundant number, since it is smaller than the sum of its proper divisors (296640656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145692144 is a wasteful number, since it uses less digits than its factorization.
145692144 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 599 (or 590 counting only the distinct ones).
The product of its digits is 34560, while the sum is 36.
The square root of 145692144 is about 12070.3000791198. The cubic root of 145692144 is about 526.1933777939.
The spelling of 145692144 in words is "one hundred forty-five million, six hundred ninety-two thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •