Base | Representation |
---|---|
bin | 10111001111010111100110… |
… | …10001010111100111001111 |
3 | 20200221122111021221120211111 |
4 | 23213223303101113213033 |
5 | 23144303233142220323 |
6 | 300405331203432451 |
7 | 13523154316100620 |
oct | 1347536321274717 |
9 | 220848437846744 |
10 | 51105602304463 |
11 | 153138451a9373 |
12 | 5894736985727 |
13 | 22693120815b5 |
14 | c8974ab59a47 |
15 | 5d959238cc0d |
hex | 2e7af34579cf |
51105602304463 has 16 divisors (see below), whose sum is σ = 60290807664640. Its totient is φ = 42391513555200.
The previous prime is 51105602304461. The next prime is 51105602304473. The reversal of 51105602304463 is 36440320650115.
It is not a de Polignac number, because 51105602304463 - 21 = 51105602304461 is a prime.
It is a super-2 number, since 2×511056023044632 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51105602304461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 47845183 + ... + 48901663.
It is an arithmetic number, because the mean of its divisors is an integer number (3768175479040).
Almost surely, 251105602304463 is an apocalyptic number.
51105602304463 is a deficient number, since it is larger than the sum of its proper divisors (9185205360177).
51105602304463 is a wasteful number, since it uses less digits than its factorization.
51105602304463 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1279438.
The product of its (nonzero) digits is 259200, while the sum is 40.
Adding to 51105602304463 its reverse (36440320650115), we get a palindrome (87545922954578).
The spelling of 51105602304463 in words is "fifty-one trillion, one hundred five billion, six hundred two million, three hundred four thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.036 sec. • engine limits •