Base | Representation |
---|---|
bin | 10111010000001110111011… |
… | …01101101110101000011111 |
3 | 20201001111011100120202002020 |
4 | 23220013131231232220133 |
5 | 23200300101141123403 |
6 | 300431122432231223 |
7 | 13525255352246304 |
oct | 1350073555565037 |
9 | 221044140522066 |
10 | 51135305411103 |
11 | 153253a789aa91 |
12 | 589a44639b513 |
13 | 226c066a95944 |
14 | c8ad6799d0ab |
15 | 5da22edbd453 |
hex | 2e81ddb6ea1f |
51135305411103 has 8 divisors (see below), whose sum is σ = 68342355927216. Its totient is φ = 34009229251200.
The previous prime is 51135305411101. The next prime is 51135305411143. The reversal of 51135305411103 is 30111450353115.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 51135305411103 - 21 = 51135305411101 is a prime.
It is a super-2 number, since 2×511353054111032 (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 (51135305411101) 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, 20243587578 + ... + 20243590103.
It is an arithmetic number, because the mean of its divisors is an integer number (8542794490902).
Almost surely, 251135305411103 is an apocalyptic number.
51135305411103 is a deficient number, since it is larger than the sum of its proper divisors (17207050516113).
51135305411103 is a wasteful number, since it uses less digits than its factorization.
51135305411103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40487178105.
The product of its (nonzero) digits is 13500, while the sum is 33.
Adding to 51135305411103 its reverse (30111450353115), we get a palindrome (81246755764218).
The spelling of 51135305411103 in words is "fifty-one trillion, one hundred thirty-five billion, three hundred five million, four hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •