Base | Representation |
---|---|
bin | 1011110100111… |
… | …0110001000100 |
3 | 10110100020020011 |
4 | 2331032301010 |
5 | 100144340300 |
6 | 4531120004 |
7 | 1141433014 |
oct | 275166104 |
9 | 113306204 |
10 | 49605700 |
11 | 26001551 |
12 | 14743004 |
13 | a37aab1 |
14 | 6833c44 |
15 | 454ceba |
hex | 2f4ec44 |
49605700 has 36 divisors (see below), whose sum is σ = 108157140. Its totient is φ = 19747840.
The previous prime is 49605691. The next prime is 49605701. The reversal of 49605700 is 750694.
49605700 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 8620096 + 40985604 = 2936^2 + 6402^2 .
It is not an unprimeable number, because it can be changed into a prime (49605701) 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 11 ways as a sum of consecutive naturals, for example, 22236 + ... + 24364.
It is an arithmetic number, because the mean of its divisors is an integer number (3004365).
Almost surely, 249605700 is an apocalyptic number.
It is an amenable number.
49605700 is an abundant number, since it is smaller than the sum of its proper divisors (58551440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49605700 is a wasteful number, since it uses less digits than its factorization.
49605700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2376 (or 2369 counting only the distinct ones).
The product of its (nonzero) digits is 7560, while the sum is 31.
The square root of 49605700 is about 7043.1314058450. The cubic root of 49605700 is about 367.4321839478.
It can be divided in two parts, 49605 and 700, that added together give a palindrome (50305).
The spelling of 49605700 in words is "forty-nine million, six hundred five thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •