Base | Representation |
---|---|
bin | 10111001100010101010101… |
… | …00111011010001100010001 |
3 | 20200120200021120112101002220 |
4 | 23212022222213122030101 |
5 | 23141101132324132241 |
6 | 300245401535531253 |
7 | 13512502601202306 |
oct | 1346125247321421 |
9 | 220520246471086 |
10 | 51001304130321 |
11 | 15283593642436 |
12 | 5878489689b29 |
13 | 225c52cc4175c |
14 | c84694d290ad |
15 | 5d69dab30166 |
hex | 2e62aa9da311 |
51001304130321 has 32 divisors (see below), whose sum is σ = 70111232021376. Its totient is φ = 32957204544000.
The previous prime is 51001304130253. The next prime is 51001304130323. The reversal of 51001304130321 is 12303140310015.
It is not a de Polignac number, because 51001304130321 - 217 = 51001303999249 is a prime.
It is a super-2 number, since 2×510013041303212 (a number of 28 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 51001304130291 and 51001304130300.
It is not an unprimeable number, because it can be changed into a prime (51001304130323) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 22541470 + ... + 24700616.
It is an arithmetic number, because the mean of its divisors is an integer number (2190976000668).
Almost surely, 251001304130321 is an apocalyptic number.
It is an amenable number.
51001304130321 is a deficient number, since it is larger than the sum of its proper divisors (19109927891055).
51001304130321 is a wasteful number, since it uses less digits than its factorization.
51001304130321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2160433.
The product of its (nonzero) digits is 1080, while the sum is 24.
Adding to 51001304130321 its reverse (12303140310015), we get a palindrome (63304444440336).
The spelling of 51001304130321 in words is "fifty-one trillion, one billion, three hundred four million, one hundred thirty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •