Base | Representation |
---|---|
bin | 10111001111001111000101… |
… | …01111110110010011001111 |
3 | 20200221012200122120021022220 |
4 | 23213213202233312103033 |
5 | 23144214402202131021 |
6 | 300403253353510423 |
7 | 13522633110113016 |
oct | 1347474257662317 |
9 | 220835618507286 |
10 | 51101030114511 |
11 | 15311909331393 |
12 | 589387b712413 |
13 | 2268a63a50560 |
14 | c8943581ba7d |
15 | 5d93c5c8ecc6 |
hex | 2e79e2bf64cf |
51101030114511 has 16 divisors (see below), whose sum is σ = 73597517400960. Its totient is φ = 31351782353760.
The previous prime is 51101030114473. The next prime is 51101030114539. The reversal of 51101030114511 is 11541103010115.
It is a happy number.
It is not a de Polignac number, because 51101030114511 - 210 = 51101030113487 is a prime.
It is a super-2 number, since 2×511010301145112 (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 (51101030112511) 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, 1979266281 + ... + 1979292098.
It is an arithmetic number, because the mean of its divisors is an integer number (4599844837560).
Almost surely, 251101030114511 is an apocalyptic number.
51101030114511 is a deficient number, since it is larger than the sum of its proper divisors (22496487286449).
51101030114511 is a wasteful number, since it uses less digits than its factorization.
51101030114511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3958558726.
The product of its (nonzero) digits is 300, while the sum is 24.
Adding to 51101030114511 its reverse (11541103010115), we get a palindrome (62642133124626).
The spelling of 51101030114511 in words is "fifty-one trillion, one hundred one billion, thirty million, one hundred fourteen thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •