Base | Representation |
---|---|
bin | 1011000011101… |
… | …0011000111001 |
3 | 10020021011121100 |
4 | 2300322120321 |
5 | 43333022010 |
6 | 4334002013 |
7 | 1102123320 |
oct | 260723071 |
9 | 106234540 |
10 | 46376505 |
11 | 241a639a |
12 | 13646309 |
13 | 97ba026 |
14 | 62330b7 |
15 | 41112c0 |
hex | 2c3a639 |
46376505 has 24 divisors (see below), whose sum is σ = 91870272. Its totient is φ = 21200544.
The previous prime is 46376497. The next prime is 46376507. The reversal of 46376505 is 50567364.
46376505 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 46376505 - 23 = 46376497 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 46376505.
It is not an unprimeable number, because it can be changed into a prime (46376507) 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 23 ways as a sum of consecutive naturals, for example, 73299 + ... + 73928.
It is an arithmetic number, because the mean of its divisors is an integer number (3827928).
Almost surely, 246376505 is an apocalyptic number.
46376505 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
46376505 is a deficient number, since it is larger than the sum of its proper divisors (45493767).
46376505 is a wasteful number, since it uses less digits than its factorization.
46376505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147245 (or 147242 counting only the distinct ones).
The product of its (nonzero) digits is 75600, while the sum is 36.
The square root of 46376505 is about 6810.0297356179. The cubic root of 46376505 is about 359.2796939962.
The spelling of 46376505 in words is "forty-six million, three hundred seventy-six thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •