Base | Representation |
---|---|
bin | 10001010111101… |
… | …01000010010000 |
3 | 101011011200122012 |
4 | 20223311002100 |
5 | 244300112102 |
6 | 22243002052 |
7 | 3416330123 |
oct | 1053650220 |
9 | 334150565 |
10 | 145707152 |
11 | 7527aa38 |
12 | 40969328 |
13 | 24257c66 |
14 | 154cc3ba |
15 | cbd2752 |
hex | 8af5090 |
145707152 has 20 divisors (see below), whose sum is σ = 282712560. Its totient is φ = 72749088.
The previous prime is 145707137. The next prime is 145707179. The reversal of 145707152 is 251707541.
It is a super-2 number, since 2×1457071522 = 42461148287902208, which contains 22 as substring.
It is a hoax number, since the sum of its digits (32) coincides with the sum of the digits of its distinct prime factors.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5663 + ... + 17985.
It is an arithmetic number, because the mean of its divisors is an integer number (14135628).
Almost surely, 2145707152 is an apocalyptic number.
It is an amenable number.
145707152 is a deficient number, since it is larger than the sum of its proper divisors (137005408).
145707152 is a wasteful number, since it uses less digits than its factorization.
145707152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13070 (or 13064 counting only the distinct ones).
The product of its (nonzero) digits is 9800, while the sum is 32.
The square root of 145707152 is about 12070.9217543649. The cubic root of 145707152 is about 526.2114452038.
The spelling of 145707152 in words is "one hundred forty-five million, seven hundred seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •