Base | Representation |
---|---|
bin | 11001001001100111000000… |
… | …11100100001001100011101 |
3 | 21020211011211211002010100022 |
4 | 30210303200130201030131 |
5 | 24222112201201210202 |
6 | 313343041211441525 |
7 | 14435465254352312 |
oct | 1444634034411435 |
9 | 236734754063308 |
10 | 55305764475677 |
11 | 16693052256831 |
12 | 62527647562a5 |
13 | 24b2407969ca1 |
14 | d92b55912d09 |
15 | 65d96ab52ea2 |
hex | 324ce072131d |
55305764475677 has 8 divisors (see below), whose sum is σ = 55857508310592. Its totient is φ = 54754666336000.
The previous prime is 55305764475673. The next prime is 55305764475799. The reversal of 55305764475677 is 77657446750355.
It is a happy number.
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 55305764475677 - 22 = 55305764475673 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 55305764475677.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55305764475673) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 161251649 + ... + 161594262.
It is an arithmetic number, because the mean of its divisors is an integer number (6982188538824).
Almost surely, 255305764475677 is an apocalyptic number.
It is an amenable number.
55305764475677 is a deficient number, since it is larger than the sum of its proper divisors (551743834915).
55305764475677 is a wasteful number, since it uses less digits than its factorization.
55305764475677 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 322847619.
The product of its (nonzero) digits is 2593080000, while the sum is 71.
The spelling of 55305764475677 in words is "fifty-five trillion, three hundred five billion, seven hundred sixty-four million, four hundred seventy-five thousand, six hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •