Base | Representation |
---|---|
bin | 1111010100000… |
… | …1011000011110 |
3 | 11110212021021210 |
4 | 3311001120132 |
5 | 112420342232 |
6 | 10212405250 |
7 | 1406645136 |
oct | 365013036 |
9 | 143767253 |
10 | 64230942 |
11 | 33290726 |
12 | 19616826 |
13 | 103cb999 |
14 | 875dac6 |
15 | 598b5cc |
hex | 3d4161e |
64230942 has 8 divisors (see below), whose sum is σ = 128461896. Its totient is φ = 21410312.
The previous prime is 64230941. The next prime is 64230967. The reversal of 64230942 is 24903246.
64230942 is digitally balanced in base 2, 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.
64230942 is an admirable number.
It is a super-2 number, since 2×642309422 = 8251227820414728, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (64230941) 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, 5352573 + ... + 5352584.
It is an arithmetic number, because the mean of its divisors is an integer number (16057737).
Almost surely, 264230942 is an apocalyptic number.
64230942 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.
64230942 is a wasteful number, since it uses less digits than its factorization.
64230942 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10705162.
The product of its (nonzero) digits is 10368, while the sum is 30.
The square root of 64230942 is about 8014.4208773935. The cubic root of 64230942 is about 400.4805516108.
The spelling of 64230942 in words is "sixty-four million, two hundred thirty thousand, nine hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •