Base | Representation |
---|---|
bin | 10001011110010… |
… | …00110110001010 |
3 | 101012210202201201 |
4 | 20233020312022 |
5 | 300010342410 |
6 | 22313334414 |
7 | 3426602401 |
oct | 1057106612 |
9 | 335722651 |
10 | 146574730 |
11 | 75812845 |
12 | 4110740a |
13 | 2449cb13 |
14 | 15676638 |
15 | cd0483a |
hex | 8bc8d8a |
146574730 has 8 divisors (see below), whose sum is σ = 263834532. Its totient is φ = 58629888.
The previous prime is 146574709. The next prime is 146574739. The reversal of 146574730 is 37475641.
146574730 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 145853929 + 720801 = 12077^2 + 849^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 146574730.
It is not an unprimeable number, because it can be changed into a prime (146574739) 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 3 ways as a sum of consecutive naturals, for example, 7328727 + ... + 7328746.
Almost surely, 2146574730 is an apocalyptic number.
146574730 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
146574730 is a deficient number, since it is larger than the sum of its proper divisors (117259802).
146574730 is a wasteful number, since it uses less digits than its factorization.
146574730 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14657480.
The product of its (nonzero) digits is 70560, while the sum is 37.
The square root of 146574730 is about 12106.8051111761. The cubic root of 146574730 is about 527.2537787573.
The spelling of 146574730 in words is "one hundred forty-six million, five hundred seventy-four thousand, seven hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •