Base | Representation |
---|---|
bin | 1101000001111… |
… | …1100101010010 |
3 | 10210211202222220 |
4 | 3100133211102 |
5 | 102442432224 |
6 | 5231241510 |
7 | 1232363640 |
oct | 320374522 |
9 | 123752886 |
10 | 54655314 |
11 | 2894038a |
12 | 16379296 |
13 | b42832c |
14 | 738a190 |
15 | 4be9279 |
hex | 341f952 |
54655314 has 64 divisors (see below), whose sum is σ = 134922240. Its totient is φ = 14414400.
The previous prime is 54655297. The next prime is 54655331. The reversal of 54655314 is 41355645.
54655314 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (54655297) and next prime (54655331).
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 27039 + ... + 28989.
It is an arithmetic number, because the mean of its divisors is an integer number (2108160).
Almost surely, 254655314 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 54655314, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (67461120).
54655314 is an abundant number, since it is smaller than the sum of its proper divisors (80266926).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54655314 is a wasteful number, since it uses less digits than its factorization.
54655314 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2015.
The product of its digits is 36000, while the sum is 33.
The square root of 54655314 is about 7392.9232377998. The cubic root of 54655314 is about 379.4991416118.
The spelling of 54655314 in words is "fifty-four million, six hundred fifty-five thousand, three hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •