Base | Representation |
---|---|
bin | 100101001001010011110… |
… | …1111010011110000011011 |
3 | 200002001111121222112001202 |
4 | 1022102213233103300123 |
5 | 1132121010222010121 |
6 | 14505151315104415 |
7 | 1034561330300336 |
oct | 112224757236033 |
9 | 20061447875052 |
10 | 5105235344411 |
11 | 1699133293384 |
12 | 6a5518ba210b |
13 | 2b0563413327 |
14 | 139147c4b61d |
15 | 8cbeb39e40b |
hex | 4a4a7bd3c1b |
5105235344411 has 4 divisors (see below), whose sum is σ = 5105968756824. Its totient is φ = 5104501932000.
The previous prime is 5105235344399. The next prime is 5105235344453. The reversal of 5105235344411 is 1144435325015.
5105235344411 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5105235344411 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5105235349411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 366695765 + ... + 366709686.
It is an arithmetic number, because the mean of its divisors is an integer number (1276492189206).
Almost surely, 25105235344411 is an apocalyptic number.
5105235344411 is a deficient number, since it is larger than the sum of its proper divisors (733412413).
5105235344411 is an equidigital number, since it uses as much as digits as its factorization.
5105235344411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 733412412.
The product of its (nonzero) digits is 144000, while the sum is 38.
The spelling of 5105235344411 in words is "five trillion, one hundred five billion, two hundred thirty-five million, three hundred forty-four thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •