Base | Representation |
---|---|
bin | 10001100010000… |
… | …01100001110010 |
3 | 101020201212210120 |
4 | 20301001201302 |
5 | 300122202132 |
6 | 22332111110 |
7 | 3434031501 |
oct | 1061014162 |
9 | 336655716 |
10 | 147069042 |
11 | 7602016a |
12 | 41305496 |
13 | 24613b03 |
14 | 15764838 |
15 | cda102c |
hex | 8c41872 |
147069042 has 8 divisors (see below), whose sum is σ = 294138096. Its totient is φ = 49023012.
The previous prime is 147069037. The next prime is 147069049. The reversal of 147069042 is 240960741.
It is a happy number.
147069042 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
147069042 is an admirable number.
It is a super-2 number, since 2×1470690422 = 43258606229595528, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 147068994 and 147069012.
It is not an unprimeable number, because it can be changed into a prime (147069049) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12255748 + ... + 12255759.
It is an arithmetic number, because the mean of its divisors is an integer number (36767262).
Almost surely, 2147069042 is an apocalyptic number.
147069042 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
147069042 is a wasteful number, since it uses less digits than its factorization.
147069042 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24511512.
The product of its (nonzero) digits is 12096, while the sum is 33.
The square root of 147069042 is about 12127.2025628337. The cubic root of 147069042 is about 527.8458213172.
The spelling of 147069042 in words is "one hundred forty-seven million, sixty-nine thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •