Base | Representation |
---|---|
bin | 10001011000100… |
… | …10011101110100 |
3 | 101011101210222221 |
4 | 20230102131310 |
5 | 244312441300 |
6 | 22245332124 |
7 | 3420341434 |
oct | 1054223564 |
9 | 334353887 |
10 | 145827700 |
11 | 75352567 |
12 | 40a07044 |
13 | 2429aaa5 |
14 | 155202c4 |
15 | cc0831a |
hex | 8b12774 |
145827700 has 36 divisors (see below), whose sum is σ = 335064492. Its totient is φ = 54899200.
The previous prime is 145827691. The next prime is 145827713. The reversal of 145827700 is 7728541.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 9498724 + 136328976 = 3082^2 + 11676^2 .
It is a Harshad number since it is a multiple of its sum of digits (34).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 41191 + ... + 44590.
It is an arithmetic number, because the mean of its divisors is an integer number (9307347).
Almost surely, 2145827700 is an apocalyptic number.
145827700 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
145827700 is an abundant number, since it is smaller than the sum of its proper divisors (189236792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145827700 is a wasteful number, since it uses less digits than its factorization.
145827700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85812 (or 85805 counting only the distinct ones).
The product of its (nonzero) digits is 15680, while the sum is 34.
The square root of 145827700 is about 12075.9140440796. The cubic root of 145827700 is about 526.3565221633.
The spelling of 145827700 in words is "one hundred forty-five million, eight hundred twenty-seven thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •