Base | Representation |
---|---|
bin | 1011010010001… |
… | …0001100111101 |
3 | 10022001102002022 |
4 | 2310202030331 |
5 | 44103413023 |
6 | 4410205525 |
7 | 1113156500 |
oct | 264421475 |
9 | 108042068 |
10 | 47326013 |
11 | 24794809 |
12 | 13a238a5 |
13 | 9a60277 |
14 | 63dd137 |
15 | 424c7c8 |
hex | 2d2233d |
47326013 has 12 divisors (see below), whose sum is σ = 56397852. Its totient is φ = 39574080.
The previous prime is 47326007. The next prime is 47326043. The reversal of 47326013 is 31062374.
47326013 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 2 ways, for example, as 840889 + 46485124 = 917^2 + 6818^2 .
It is not a de Polignac number, because 47326013 - 220 = 46277437 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (47326003) 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, 9770 + ... + 13787.
It is an arithmetic number, because the mean of its divisors is an integer number (4699821).
Almost surely, 247326013 is an apocalyptic number.
It is an amenable number.
47326013 is a deficient number, since it is larger than the sum of its proper divisors (9071839).
47326013 is a wasteful number, since it uses less digits than its factorization.
47326013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23612 (or 23605 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 26.
The square root of 47326013 is about 6879.3904526491. The cubic root of 47326013 is about 361.7151004623.
Adding to 47326013 its reverse (31062374), we get a palindrome (78388387).
The spelling of 47326013 in words is "forty-seven million, three hundred twenty-six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •