Base | Representation |
---|---|
bin | 110001100110100101… |
… | …1010100010101001011 |
3 | 101011221200000102212011 |
4 | 1203031023110111023 |
5 | 3221124001324433 |
6 | 120534005400351 |
7 | 10460462622550 |
oct | 1431513242513 |
9 | 334850012764 |
10 | 106521511243 |
11 | 411a2686014 |
12 | 18789a090b7 |
13 | a077952834 |
14 | 5227224a27 |
15 | 2b86a393cd |
hex | 18cd2d454b |
106521511243 has 4 divisors (see below), whose sum is σ = 121738870000. Its totient is φ = 91304152488.
The previous prime is 106521511171. The next prime is 106521511247. The reversal of 106521511243 is 342115125601.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 342115125601 = 17 ⋅20124419153.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106521511243 is a prime.
It is a super-2 number, since 2×1065215112432 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106521511247) 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, 7608679368 + ... + 7608679381.
It is an arithmetic number, because the mean of its divisors is an integer number (30434717500).
Almost surely, 2106521511243 is an apocalyptic number.
106521511243 is a deficient number, since it is larger than the sum of its proper divisors (15217358757).
106521511243 is an equidigital number, since it uses as much as digits as its factorization.
106521511243 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15217358756.
The product of its (nonzero) digits is 7200, while the sum is 31.
Adding to 106521511243 its reverse (342115125601), we get a palindrome (448636636844).
The spelling of 106521511243 in words is "one hundred six billion, five hundred twenty-one million, five hundred eleven thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •