Base | Representation |
---|---|
bin | 10111010000110011101111… |
… | …00010100110110110000001 |
3 | 20201010101011111201111221120 |
4 | 23220121313202212312001 |
5 | 23201111033402243230 |
6 | 300444151331342453 |
7 | 13526555140045146 |
oct | 1350316742466601 |
9 | 221111144644846 |
10 | 51155066056065 |
11 | 153328181a7024 |
12 | 58a2240151a29 |
13 | 2270b959b717a |
14 | c8bcc017a3cd |
15 | 5da9d9b09310 |
hex | 2e86778a6d81 |
51155066056065 has 16 divisors (see below), whose sum is σ = 82445537121408. Its totient is φ = 27083558086016.
The previous prime is 51155066056057. The next prime is 51155066056099. The reversal of 51155066056065 is 56065066055115.
51155066056065 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 51155066056065 - 23 = 51155066056057 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 51155066055999 and 51155066056017.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 12446486037 + ... + 12446490146.
It is an arithmetic number, because the mean of its divisors is an integer number (5152846070088).
Almost surely, 251155066056065 is an apocalyptic number.
It is an amenable number.
51155066056065 is a deficient number, since it is larger than the sum of its proper divisors (31290471065343).
51155066056065 is a wasteful number, since it uses less digits than its factorization.
51155066056065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24892976328.
The product of its (nonzero) digits is 4050000, while the sum is 51.
The spelling of 51155066056065 in words is "fifty-one trillion, one hundred fifty-five billion, sixty-six million, fifty-six thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •