Base | Representation |
---|---|
bin | 1101000001010… |
… | …1000000101101 |
3 | 10210202120121011 |
4 | 3100111000231 |
5 | 102440041023 |
6 | 5230305221 |
7 | 1232123461 |
oct | 320250055 |
9 | 123676534 |
10 | 54612013 |
11 | 289108a5 |
12 | 16358211 |
13 | b411701 |
14 | 73784a1 |
15 | 4bdb50d |
hex | 341502d |
54612013 has 4 divisors (see below), whose sum is σ = 55152828. Its totient is φ = 54071200.
The previous prime is 54612011. The next prime is 54612043. The reversal of 54612013 is 31021645.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 27175369 + 27436644 = 5213^2 + 5238^2 .
It is a cyclic number.
It is not a de Polignac number, because 54612013 - 21 = 54612011 is a prime.
It is a Smith number, since the sum of its digits (22) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54612011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 270256 + ... + 270457.
It is an arithmetic number, because the mean of its divisors is an integer number (13788207).
Almost surely, 254612013 is an apocalyptic number.
It is an amenable number.
54612013 is a deficient number, since it is larger than the sum of its proper divisors (540815).
54612013 is a wasteful number, since it uses less digits than its factorization.
54612013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 540814.
The product of its (nonzero) digits is 720, while the sum is 22.
The square root of 54612013 is about 7389.9941136648. The cubic root of 54612013 is about 379.3988949772.
Adding to 54612013 its reverse (31021645), we get a palindrome (85633658).
The spelling of 54612013 in words is "fifty-four million, six hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •