Base | Representation |
---|---|
bin | 10001011101011… |
… | …10101000001010 |
3 | 101012121022102020 |
4 | 20232232220022 |
5 | 244443423323 |
6 | 22311145310 |
7 | 3425644323 |
oct | 1056565012 |
9 | 335538366 |
10 | 146467338 |
11 | 7574a096 |
12 | 41075236 |
13 | 24462c84 |
14 | 1564944a |
15 | ccd2ae3 |
hex | 8baea0a |
146467338 has 16 divisors (see below), whose sum is σ = 294325536. Its totient is φ = 48590640.
The previous prime is 146467337. The next prime is 146467357. The reversal of 146467338 is 833764641.
It is a happy number.
146467338 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1464673382 = 42905362201612488, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 146467338.
It is not an unprimeable number, because it can be changed into a prime (146467337) 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 7 ways as a sum of consecutive naturals, for example, 56581 + ... + 59112.
It is an arithmetic number, because the mean of its divisors is an integer number (18395346).
Almost surely, 2146467338 is an apocalyptic number.
146467338 is an abundant number, since it is smaller than the sum of its proper divisors (147858198).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146467338 is a wasteful number, since it uses less digits than its factorization.
146467338 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115909.
The product of its digits is 290304, while the sum is 42.
The square root of 146467338 is about 12102.3691069146. The cubic root of 146467338 is about 527.1249783104.
The spelling of 146467338 in words is "one hundred forty-six million, four hundred sixty-seven thousand, three hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •