Base | Representation |
---|---|
bin | 1100111101000… |
… | …0011101000011 |
3 | 10210020022101210 |
4 | 3033100131003 |
5 | 102402044303 |
6 | 5220301203 |
7 | 1226544003 |
oct | 317203503 |
9 | 123208353 |
10 | 54331203 |
11 | 28739923 |
12 | 16241803 |
13 | b343954 |
14 | 7304003 |
15 | 4b83203 |
hex | 33d0743 |
54331203 has 8 divisors (see below), whose sum is σ = 76254400. Its totient is φ = 34314408.
The previous prime is 54331183. The next prime is 54331213. The reversal of 54331203 is 30213345.
54331203 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 54331203 - 221 = 52234051 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 54331203.
It is not an unprimeable number, because it can be changed into a prime (54331213) 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 7 ways as a sum of consecutive naturals, for example, 476533 + ... + 476646.
It is an arithmetic number, because the mean of its divisors is an integer number (9531800).
Almost surely, 254331203 is an apocalyptic number.
54331203 is a deficient number, since it is larger than the sum of its proper divisors (21923197).
54331203 is a wasteful number, since it uses less digits than its factorization.
54331203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 953201.
The product of its (nonzero) digits is 1080, while the sum is 21.
The square root of 54331203 is about 7370.9702889104. The cubic root of 54331203 is about 378.7474990304.
Adding to 54331203 its reverse (30213345), we get a palindrome (84544548).
The spelling of 54331203 in words is "fifty-four million, three hundred thirty-one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •