Base | Representation |
---|---|
bin | 1010111111100… |
… | …0101100100000 |
3 | 10012202111111101 |
4 | 2233320230200 |
5 | 43300414144 |
6 | 4324124144 |
7 | 1066622656 |
oct | 257705440 |
9 | 105674441 |
10 | 46107424 |
11 | 24032210 |
12 | 13536654 |
13 | 97246cc |
14 | 61a2dd6 |
15 | 40ab6d4 |
hex | 2bf8b20 |
46107424 has 24 divisors (see below), whose sum is σ = 99026928. Its totient is φ = 20957760.
The previous prime is 46107389. The next prime is 46107431. The reversal of 46107424 is 42470164.
46107424 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 46107392 and 46107401.
It is an unprimeable number.
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, 65142 + ... + 65845.
It is an arithmetic number, because the mean of its divisors is an integer number (4126122).
Almost surely, 246107424 is an apocalyptic number.
46107424 is a gapful number since it is divisible by the number (44) formed by its first and last digit.
It is an amenable number.
46107424 is an abundant number, since it is smaller than the sum of its proper divisors (52919504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46107424 is a wasteful number, since it uses less digits than its factorization.
46107424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131008 (or 131000 counting only the distinct ones).
The product of its (nonzero) digits is 5376, while the sum is 28.
The square root of 46107424 is about 6790.2447673114. The cubic root of 46107424 is about 358.5834871733.
Adding to 46107424 its reverse (42470164), we get a palindrome (88577588).
The spelling of 46107424 in words is "forty-six million, one hundred seven thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •