Base | Representation |
---|---|
bin | 10111001111011000111100… |
… | …10100101110110111000001 |
3 | 20200221201100122002022211010 |
4 | 23213230132110232313001 |
5 | 23144311223044401101 |
6 | 300405531005111133 |
7 | 13523211236416311 |
oct | 1347543624566701 |
9 | 220851318068733 |
10 | 51106324606401 |
11 | 153140859a0519 |
12 | 58948b88584a9 |
13 | 22693c88cbaac |
14 | c897b8a5b441 |
15 | 5d95d59b82d6 |
hex | 2e7b1e52edc1 |
51106324606401 has 16 divisors (see below), whose sum is σ = 68168125960704. Its totient is φ = 34057704703104.
The previous prime is 51106324606333. The next prime is 51106324606423. The reversal of 51106324606401 is 10460642360115.
It is not a de Polignac number, because 51106324606401 - 210 = 51106324605377 is a prime.
It is a super-2 number, since 2×511063246064012 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 51106324606401.
It is not an unprimeable number, because it can be changed into a prime (51106324606501) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 138844335 + ... + 139211931.
It is an arithmetic number, because the mean of its divisors is an integer number (4260507872544).
Almost surely, 251106324606401 is an apocalyptic number.
It is an amenable number.
51106324606401 is a deficient number, since it is larger than the sum of its proper divisors (17061801354303).
51106324606401 is a wasteful number, since it uses less digits than its factorization.
51106324606401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 385400.
The product of its (nonzero) digits is 103680, while the sum is 39.
Adding to 51106324606401 its reverse (10460642360115), we get a palindrome (61566966966516).
The spelling of 51106324606401 in words is "fifty-one trillion, one hundred six billion, three hundred twenty-four million, six hundred six thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •