Base | Representation |
---|---|
bin | 10001010100100… |
… | …11001111101000 |
3 | 101010102100011221 |
4 | 20222103033220 |
5 | 244144302400 |
6 | 22230231424 |
7 | 3413041255 |
oct | 1052231750 |
9 | 333370157 |
10 | 145306600 |
11 | 75026aaa |
12 | 407b5574 |
13 | 2414784a |
14 | 1542642c |
15 | cb53c1a |
hex | 8a933e8 |
145306600 has 24 divisors (see below), whose sum is σ = 337838310. Its totient is φ = 58122560.
The previous prime is 145306591. The next prime is 145306607. The reversal of 145306600 is 6603541.
It can be written as a sum of positive squares in 3 ways, for example, as 78818884 + 66487716 = 8878^2 + 8154^2 .
It is a super-2 number, since 2×1453066002 = 42228016007120000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (145306607) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 363067 + ... + 363466.
Almost surely, 2145306600 is an apocalyptic number.
145306600 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
145306600 is an abundant number, since it is smaller than the sum of its proper divisors (192531710).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145306600 is a wasteful number, since it uses less digits than its factorization.
145306600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 726549 (or 726540 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 25.
The square root of 145306600 is about 12054.3187281571. The cubic root of 145306600 is about 525.7288139326.
The spelling of 145306600 in words is "one hundred forty-five million, three hundred six thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •