Base | Representation |
---|---|
bin | 1101000010010… |
… | …1010110100111 |
3 | 10210212222102100 |
4 | 3100211112213 |
5 | 102444211301 |
6 | 5231543143 |
7 | 1232522565 |
oct | 320452647 |
9 | 123788370 |
10 | 54678951 |
11 | 28957118 |
12 | 1638aab3 |
13 | b436012 |
14 | 7394a35 |
15 | 4c01286 |
hex | 34255a7 |
54678951 has 12 divisors (see below), whose sum is σ = 79424280. Its totient is φ = 36247920.
The previous prime is 54678937. The next prime is 54678959. The reversal of 54678951 is 15987645.
54678951 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 54678951 - 29 = 54678439 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 54678897 and 54678906.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54678959) 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, 15360 + ... + 18581.
It is an arithmetic number, because the mean of its divisors is an integer number (6618690).
Almost surely, 254678951 is an apocalyptic number.
54678951 is a deficient number, since it is larger than the sum of its proper divisors (24745329).
54678951 is a wasteful number, since it uses less digits than its factorization.
54678951 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34126 (or 34123 counting only the distinct ones).
The product of its digits is 302400, while the sum is 45.
The square root of 54678951 is about 7394.5216883853. The cubic root of 54678951 is about 379.5538415592.
It can be divided in two parts, 546 and 78951, that added together give a palindrome (79497).
The spelling of 54678951 in words is "fifty-four million, six hundred seventy-eight thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •