Base | Representation |
---|---|
bin | 11001001010100111110010… |
… | …11111110011001000100011 |
3 | 21020221111121200211122100121 |
4 | 30211103321133303020203 |
5 | 24223144413343114410 |
6 | 313411032320301111 |
7 | 14441136165621655 |
oct | 1445237137631043 |
9 | 236844550748317 |
10 | 55340544504355 |
11 | 166a687a714090 |
12 | 6259450471797 |
13 | 24b578b433306 |
14 | d946d4b1c6d5 |
15 | 65e8042319da |
hex | 3254f97f3223 |
55340544504355 has 64 divisors (see below), whose sum is σ = 79866402973056. Its totient is φ = 36350410752000.
The previous prime is 55340544504337. The next prime is 55340544504373.
55340544504355 is nontrivially palindromic in base 10.
It is an interprime number because it is at equal distance from previous prime (55340544504337) and next prime (55340544504373).
It is not a de Polignac number, because 55340544504355 - 27 = 55340544504227 is a prime.
It is a super-2 number, since 2×553405445043552 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 9494382 + ... + 14171251.
It is an arithmetic number, because the mean of its divisors is an integer number (1247912546454).
Almost surely, 255340544504355 is an apocalyptic number.
55340544504355 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
55340544504355 is a deficient number, since it is larger than the sum of its proper divisors (24525858468701).
55340544504355 is a wasteful number, since it uses less digits than its factorization.
55340544504355 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23665768.
The product of its (nonzero) digits is 36000000, while the sum is 52.
The spelling of 55340544504355 in words is "fifty-five trillion, three hundred forty billion, five hundred forty-four million, five hundred four thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •