Base | Representation |
---|---|
bin | 10111010000010111111101… |
… | …00000110111000110010011 |
3 | 20201001221200000202112220002 |
4 | 23220023332200313012103 |
5 | 23200340012031401311 |
6 | 300433243314440215 |
7 | 13525516415160035 |
oct | 1350137640670623 |
9 | 221057600675802 |
10 | 51140150653331 |
11 | 15327463906203 |
12 | 589b378b9306b |
13 | 226c65984ab8c |
14 | c8b2a7297c55 |
15 | 5da41545593b |
hex | 2e82fe837193 |
51140150653331 has 8 divisors (see below), whose sum is σ = 52416788577600. Its totient is φ = 49871368963008.
The previous prime is 51140150653283. The next prime is 51140150653373. The reversal of 51140150653331 is 13335605104115.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 51140150653331 - 234 = 51122970784147 is a prime.
It is a super-2 number, since 2×511401506533312 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (51140150653831) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1964045306 + ... + 1964071343.
It is an arithmetic number, because the mean of its divisors is an integer number (6552098572200).
Almost surely, 251140150653331 is an apocalyptic number.
51140150653331 is a deficient number, since it is larger than the sum of its proper divisors (1276637924269).
51140150653331 is a wasteful number, since it uses less digits than its factorization.
51140150653331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3928116973.
The product of its (nonzero) digits is 81000, while the sum is 38.
Adding to 51140150653331 its reverse (13335605104115), we get a palindrome (64475755757446).
The spelling of 51140150653331 in words is "fifty-one trillion, one hundred forty billion, one hundred fifty million, six hundred fifty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •