Base | Representation |
---|---|
bin | 10111001101000010111001… |
… | …01111001010100101010001 |
3 | 20200200000102110101102011012 |
4 | 23212201130233022211101 |
5 | 23142001232420010330 |
6 | 300304525223300305 |
7 | 13514330040116324 |
oct | 1346413457124521 |
9 | 220600373342135 |
10 | 51025767344465 |
11 | 152929a7477291 |
12 | 58811762aa695 |
13 | 226192b1b32b4 |
14 | c85935ca27bb |
15 | 5d746d61ec95 |
hex | 2e685cbca951 |
51025767344465 has 16 divisors (see below), whose sum is σ = 64854358128000. Its totient is φ = 38406590365440.
The previous prime is 51025767344407. The next prime is 51025767344501. The reversal of 51025767344465 is 56444376752015.
51025767344465 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-51025767344465 is a prime.
It is a super-2 number, since 2×510257673444652 (a number of 28 digits) contains 22 as substring.
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, 99828971 + ... + 100338800.
It is an arithmetic number, because the mean of its divisors is an integer number (4053397383000).
Almost surely, 251025767344465 is an apocalyptic number.
It is an amenable number.
51025767344465 is a deficient number, since it is larger than the sum of its proper divisors (13828590783535).
51025767344465 is a wasteful number, since it uses less digits than its factorization.
51025767344465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200170792.
The product of its (nonzero) digits is 84672000, while the sum is 59.
The spelling of 51025767344465 in words is "fifty-one trillion, twenty-five billion, seven hundred sixty-seven million, three hundred forty-four thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •