Base | Representation |
---|---|
bin | 110011001111100010… |
… | …110101100110111111 |
3 | 12021000112220002101102 |
4 | 303033202311212333 |
5 | 1400141013424433 |
6 | 41135424203315 |
7 | 3655326041132 |
oct | 631742654677 |
9 | 167015802342 |
10 | 55021623743 |
11 | 213752aa319 |
12 | a7b676953b |
13 | 525b22cb18 |
14 | 293d620219 |
15 | 167066d4e8 |
hex | ccf8b59bf |
55021623743 has 8 divisors (see below), whose sum is σ = 56485897776. Its totient is φ = 53563172800.
The previous prime is 55021623739. The next prime is 55021623749. The reversal of 55021623743 is 34732612055.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 55021623743 - 22 = 55021623739 is a prime.
It is a super-2 number, since 2×550216237432 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 55021623697 and 55021623706.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55021623749) 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, 1436621 + ... + 1474422.
It is an arithmetic number, because the mean of its divisors is an integer number (7060737222).
Almost surely, 255021623743 is an apocalyptic number.
55021623743 is a deficient number, since it is larger than the sum of its proper divisors (1464274033).
55021623743 is a wasteful number, since it uses less digits than its factorization.
55021623743 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2911545.
The product of its (nonzero) digits is 151200, while the sum is 38.
The spelling of 55021623743 in words is "fifty-five billion, twenty-one million, six hundred twenty-three thousand, seven hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •