Base | Representation |
---|---|
bin | 1010000110011111000011… |
… | …0011100011011010111111 |
3 | 1110022202220012121010020200 |
4 | 2201213300303203122333 |
5 | 2423432133302201211 |
6 | 35342134130014543 |
7 | 2224264115432223 |
oct | 241476063433277 |
9 | 43282805533220 |
10 | 11106530506431 |
11 | 35a2286a19168 |
12 | 12b462a717453 |
13 | 627458ba5c89 |
14 | 2a57b7a5c783 |
15 | 143d8ddbdb56 |
hex | a19f0ce36bf |
11106530506431 has 48 divisors (see below), whose sum is σ = 16109772696576. Its totient is φ = 7373516712768.
The previous prime is 11106530506411. The next prime is 11106530506447. The reversal of 11106530506431 is 13460503560111.
11106530506431 is a `hidden beast` number, since 1 + 1 + 1 + 0 + 6 + 5 + 3 + 0 + 5 + 0 + 643 + 1 = 666.
It is not a de Polignac number, because 11106530506431 - 237 = 10969091552959 is a prime.
It is a super-2 number, since 2×111065305064312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11106530506411) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 7805010186 + ... + 7805011608.
It is an arithmetic number, because the mean of its divisors is an integer number (335620264512).
Almost surely, 211106530506431 is an apocalyptic number.
11106530506431 is a deficient number, since it is larger than the sum of its proper divisors (5003242190145).
11106530506431 is a wasteful number, since it uses less digits than its factorization.
11106530506431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4532 (or 4529 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 36.
The spelling of 11106530506431 in words is "eleven trillion, one hundred six billion, five hundred thirty million, five hundred six thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •