Base | Representation |
---|---|
bin | 1011000001001… |
… | …0101110110000 |
3 | 10012221220210000 |
4 | 2300102232300 |
5 | 43312322224 |
6 | 4330310000 |
7 | 1100545611 |
oct | 260225660 |
9 | 105856700 |
10 | 46214064 |
11 | 240a5346 |
12 | 13588300 |
13 | 9761100 |
14 | 61cdc08 |
15 | 40cd0c9 |
hex | 2c12bb0 |
46214064 has 150 divisors (see below), whose sum is σ = 145523796. Its totient is φ = 14152320.
The previous prime is 46214059. The next prime is 46214071. The reversal of 46214064 is 46041264.
46214064 is a `hidden beast` number, since 462 + 140 + 64 = 666.
It is a super-2 number, since 2×462140642 = 4271479422792192, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a nialpdrome in base 13.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 218919 + ... + 219129.
Almost surely, 246214064 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 46214064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (72761898).
46214064 is an abundant number, since it is smaller than the sum of its proper divisors (99309732).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46214064 is a wasteful number, since it uses less digits than its factorization.
46214064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257 (or 229 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
The square root of 46214064 is about 6798.0926736843. The cubic root of 46214064 is about 358.8597254073.
The spelling of 46214064 in words is "forty-six million, two hundred fourteen thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •