Base | Representation |
---|---|
bin | 11001000100001110000011… |
… | …10010101100001011101001 |
3 | 21020011110211001121021201102 |
4 | 30202013001302230023221 |
5 | 24211043410022203200 |
6 | 313122012210331145 |
7 | 14416221011400044 |
oct | 1442070162541351 |
9 | 236143731537642 |
10 | 55120566600425 |
11 | 16621556945a87 |
12 | 622289a289ab5 |
13 | 249ab021a4a11 |
14 | d87bc7667c5b |
15 | 658c2be586d5 |
hex | 3221c1cac2e9 |
55120566600425 has 24 divisors (see below), whose sum is σ = 71506277805312. Its totient is φ = 42105591056000.
The previous prime is 55120566600409. The next prime is 55120566600457. The reversal of 55120566600425 is 52400666502155.
It is not a de Polignac number, because 55120566600425 - 24 = 55120566600409 is a prime.
It is a super-2 number, since 2×551205666004252 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (47).
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 55120566600425.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 572038661 + ... + 572135010.
It is an arithmetic number, because the mean of its divisors is an integer number (2979428241888).
Almost surely, 255120566600425 is an apocalyptic number.
It is an amenable number.
55120566600425 is a deficient number, since it is larger than the sum of its proper divisors (16385711204887).
55120566600425 is a wasteful number, since it uses less digits than its factorization.
55120566600425 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1144173769 (or 1144173764 counting only the distinct ones).
The product of its (nonzero) digits is 2160000, while the sum is 47.
The spelling of 55120566600425 in words is "fifty-five trillion, one hundred twenty billion, five hundred sixty-six million, six hundred thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •