Base | Representation |
---|---|
bin | 10001010100111… |
… | …10100101010010 |
3 | 101010111200220000 |
4 | 20222132211102 |
5 | 244202244132 |
6 | 22231230430 |
7 | 3413323542 |
oct | 1052364522 |
9 | 333450800 |
10 | 145353042 |
11 | 7505898a |
12 | 40818416 |
13 | 24162a23 |
14 | 15439322 |
15 | cb6287c |
hex | 8a9e952 |
145353042 has 20 divisors (see below), whose sum is σ = 325698846. Its totient is φ = 48450960.
The previous prime is 145353041. The next prime is 145353067. The reversal of 145353042 is 240353541.
It can be written as a sum of positive squares in only one way, i.e., 103245921 + 42107121 = 10161^2 + 6489^2 .
It is a super-2 number, since 2×1453530422 = 42255013637307528, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 145352997 and 145353015.
It is not an unprimeable number, because it can be changed into a prime (145353041) 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 9 ways as a sum of consecutive naturals, for example, 448459 + ... + 448782.
Almost surely, 2145353042 is an apocalyptic number.
145353042 is an abundant number, since it is smaller than the sum of its proper divisors (180345804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145353042 is an equidigital number, since it uses as much as digits as its factorization.
145353042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 897255 (or 897246 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 27.
The square root of 145353042 is about 12056.2449377905. The cubic root of 145353042 is about 525.7848180343.
The spelling of 145353042 in words is "one hundred forty-five million, three hundred fifty-three thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.412 sec. • engine limits •