Base | Representation |
---|---|
bin | 1010100111111011011001… |
… | …0100010000001101010101 |
3 | 1112100200220012010100122111 |
4 | 2221332312110100031111 |
5 | 3012340320124343110 |
6 | 40502113421031021 |
7 | 2313633631620415 |
oct | 251766624201525 |
9 | 45320805110574 |
10 | 11681074840405 |
11 | 37a3a0924a043 |
12 | 1387a543b5471 |
13 | 66969ca982b9 |
14 | 2c551d224645 |
15 | 153cb905be8a |
hex | a9fb6510355 |
11681074840405 has 4 divisors (see below), whose sum is σ = 14017289808492. Its totient is φ = 9344859872320.
The previous prime is 11681074840349. The next prime is 11681074840417. The reversal of 11681074840405 is 50404847018611.
11681074840405 is digitally balanced in base 2, 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 can be written as a sum of positive squares in 2 ways, for example, as 7065426499569 + 4615648340836 = 2658087^2 + 2148406^2 .
It is not a de Polignac number, because 11681074840405 - 213 = 11681074832213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1168107484036 + ... + 1168107484045.
It is an arithmetic number, because the mean of its divisors is an integer number (3504322452123).
Almost surely, 211681074840405 is an apocalyptic number.
It is an amenable number.
11681074840405 is a deficient number, since it is larger than the sum of its proper divisors (2336214968087).
11681074840405 is an equidigital number, since it uses as much as digits as its factorization.
11681074840405 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2336214968086.
The product of its (nonzero) digits is 860160, while the sum is 49.
The spelling of 11681074840405 in words is "eleven trillion, six hundred eighty-one billion, seventy-four million, eight hundred forty thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •