Base | Representation |
---|---|
bin | 1010011001011100011011… |
… | …0110110001110110110011 |
3 | 1111110220121202102022102221 |
4 | 2212113012312301312303 |
5 | 2444301214010122121 |
6 | 40151522301221511 |
7 | 2256644445360514 |
oct | 246270666616663 |
9 | 44426552368387 |
10 | 11432244223411 |
11 | 370842990a630 |
12 | 134778b561897 |
13 | 64c096070b1b |
14 | 2b7475c52a0b |
15 | 14c5a3c31b41 |
hex | a65c6db1db3 |
11432244223411 has 8 divisors (see below), whose sum is σ = 12471571078848. Its totient is φ = 10392922689000.
The previous prime is 11432244223409. The next prime is 11432244223427.
11432244223411 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11432244223411 - 21 = 11432244223409 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11432244223451) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4140196 + ... + 6325006.
It is an arithmetic number, because the mean of its divisors is an integer number (1558946384856).
Almost surely, 211432244223411 is an apocalyptic number.
11432244223411 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11432244223411 is a deficient number, since it is larger than the sum of its proper divisors (1039326855437).
11432244223411 is a wasteful number, since it uses less digits than its factorization.
11432244223411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2660513.
The product of its digits is 36864, while the sum is 34.
It can be divided in two parts, 1143224 and 4223411, that added together give a palindrome (5366635).
The spelling of 11432244223411 in words is "eleven trillion, four hundred thirty-two billion, two hundred forty-four million, two hundred twenty-three thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •