Base | Representation |
---|---|
bin | 10001010101001… |
… | …11110010100000 |
3 | 101010120121121200 |
4 | 20222213302200 |
5 | 244210001002 |
6 | 22232121200 |
7 | 3413541513 |
oct | 1052476240 |
9 | 333517550 |
10 | 145390752 |
11 | 75084251 |
12 | 40836200 |
13 | 24176c40 |
14 | 15448d7a |
15 | cb6db1c |
hex | 8aa7ca0 |
145390752 has 72 divisors (see below), whose sum is σ = 445270644. Its totient is φ = 44734464.
The previous prime is 145390741. The next prime is 145390753. The reversal of 145390752 is 257093541.
It can be written as a sum of positive squares in 2 ways, for example, as 128051856 + 17338896 = 11316^2 + 4164^2 .
It is a tau number, because it is divible by the number of its divisors (72).
It is a super-2 number, since 2×1453907522 = 42276941534251008, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (145390753) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 15673 + ... + 23160.
Almost surely, 2145390752 is an apocalyptic number.
145390752 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
145390752 is an abundant number, since it is smaller than the sum of its proper divisors (299879892).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145390752 is a wasteful number, since it uses less digits than its factorization.
145390752 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38862 (or 38851 counting only the distinct ones).
The product of its (nonzero) digits is 37800, while the sum is 36.
The square root of 145390752 is about 12057.8087561547. The cubic root of 145390752 is about 525.8302834997.
The spelling of 145390752 in words is "one hundred forty-five million, three hundred ninety thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •