Base | Representation |
---|---|
bin | 1010011000011100100100… |
… | …1011110001001101001101 |
3 | 1111102021101011221211020121 |
4 | 2212013021023301031031 |
5 | 2444011112433123041 |
6 | 40140005350144541 |
7 | 2255466622023532 |
oct | 246071113611515 |
9 | 44367334854217 |
10 | 11415103411021 |
11 | 3701133314582 |
12 | 13443a7052151 |
13 | 64a593b4769b |
14 | 2b66cb59ad89 |
15 | 14bdedee27d1 |
hex | a61c92f134d |
11415103411021 has 4 divisors (see below), whose sum is σ = 11783332553344. Its totient is φ = 11046874268700.
The previous prime is 11415103411009. The next prime is 11415103411031. The reversal of 11415103411021 is 12011430151411.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11415103411021 - 29 = 11415103410509 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11415103411031) 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, 184114571115 + ... + 184114571176.
It is an arithmetic number, because the mean of its divisors is an integer number (2945833138336).
Almost surely, 211415103411021 is an apocalyptic number.
It is an amenable number.
11415103411021 is a deficient number, since it is larger than the sum of its proper divisors (368229142323).
11415103411021 is an equidigital number, since it uses as much as digits as its factorization.
11415103411021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 368229142322.
The product of its (nonzero) digits is 480, while the sum is 25.
Adding to 11415103411021 its reverse (12011430151411), we get a palindrome (23426533562432).
The spelling of 11415103411021 in words is "eleven trillion, four hundred fifteen billion, one hundred three million, four hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •