Base | Representation |
---|---|
bin | 1011001100011… |
… | …0101011100010 |
3 | 10021100100212001 |
4 | 2303012223202 |
5 | 44004414023 |
6 | 4354154214 |
7 | 1110035533 |
oct | 263065342 |
9 | 107310761 |
10 | 46951138 |
11 | 245590a3 |
12 | 1388296a |
13 | 995b750 |
14 | 634268a |
15 | 41c66ad |
hex | 2cc6ae2 |
46951138 has 32 divisors (see below), whose sum is σ = 78059520. Its totient is φ = 21047040.
The previous prime is 46951129. The next prime is 46951139. The reversal of 46951138 is 83115964.
46951138 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (37) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 46951097 and 46951106.
It is not an unprimeable number, because it can be changed into a prime (46951139) 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 15 ways as a sum of consecutive naturals, for example, 194698 + ... + 194938.
It is an arithmetic number, because the mean of its divisors is an integer number (2439360).
Almost surely, 246951138 is an apocalyptic number.
46951138 is a deficient number, since it is larger than the sum of its proper divisors (31108382).
46951138 is a wasteful number, since it uses less digits than its factorization.
46951138 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 442.
The product of its digits is 25920, while the sum is 37.
The square root of 46951138 is about 6852.0900461100. The cubic root of 46951138 is about 360.7575047500.
It can be divided in two parts, 46951 and 138, that added together give a square (47089 = 2172).
The spelling of 46951138 in words is "forty-six million, nine hundred fifty-one thousand, one hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •