Base | Representation |
---|---|
bin | 110010111010001000… |
… | …001111111111111101 |
3 | 12020002111211012100010 |
4 | 302322020033333331 |
5 | 1343422024114123 |
6 | 41040031253433 |
7 | 3643404105423 |
oct | 627210177775 |
9 | 166074735303 |
10 | 54662332413 |
11 | 21200509437 |
12 | a71637a279 |
13 | 52019727c0 |
14 | 2907a15113 |
15 | 164dd4b993 |
hex | cba20fffd |
54662332413 has 8 divisors (see below), whose sum is σ = 78489503008. Its totient is φ = 33638358384.
The previous prime is 54662332327. The next prime is 54662332429. The reversal of 54662332413 is 31423326645.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 54662332413 - 213 = 54662324221 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39), and also a Moran number because the ratio is a prime number: 1401598267 = 54662332413 / (5 + 4 + 6 + 6 + 2 + 3 + 3 + 2 + 4 + 1 + 3).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54662332453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 700799095 + ... + 700799172.
It is an arithmetic number, because the mean of its divisors is an integer number (9811187876).
Almost surely, 254662332413 is an apocalyptic number.
It is an amenable number.
54662332413 is a deficient number, since it is larger than the sum of its proper divisors (23827170595).
54662332413 is a wasteful number, since it uses less digits than its factorization.
54662332413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1401598283.
The product of its digits is 311040, while the sum is 39.
The spelling of 54662332413 in words is "fifty-four billion, six hundred sixty-two million, three hundred thirty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.166 sec. • engine limits •