Base | Representation |
---|---|
bin | 1001100011011110101111… |
… | …0100011111011001000111 |
3 | 1101012021122001210110111112 |
4 | 2120313223310133121013 |
5 | 2334104022232211201 |
6 | 34201555553355235 |
7 | 2132654305645511 |
oct | 230675364373107 |
9 | 41167561713445 |
10 | 10505151444551 |
11 | 3390234138005 |
12 | 1217b75b68b1b |
13 | 5b282961b42a |
14 | 284648596bb1 |
15 | 1333e2e450bb |
hex | 98debd1f647 |
10505151444551 has 4 divisors (see below), whose sum is σ = 10505350409592. Its totient is φ = 10504952479512.
The previous prime is 10505151444527. The next prime is 10505151444587. The reversal of 10505151444551 is 15544415150501.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10505151444551 - 226 = 10505084335687 is a prime.
It is a super-2 number, since 2×105051514445512 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10505151444499 and 10505151444508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10505151444751) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 99403301 + ... + 99508926.
It is an arithmetic number, because the mean of its divisors is an integer number (2626337602398).
Almost surely, 210505151444551 is an apocalyptic number.
10505151444551 is a deficient number, since it is larger than the sum of its proper divisors (198965041).
10505151444551 is an equidigital number, since it uses as much as digits as its factorization.
10505151444551 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 198965040.
The product of its (nonzero) digits is 200000, while the sum is 41.
The spelling of 10505151444551 in words is "ten trillion, five hundred five billion, one hundred fifty-one million, four hundred forty-four thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •