Base | Representation |
---|---|
bin | 1010001100101111100011… |
… | …1001010011000011111111 |
3 | 1110201001101202110012210110 |
4 | 2203023320321103003333 |
5 | 2432212323321144130 |
6 | 35503354204241103 |
7 | 2235121242522321 |
oct | 243137071230377 |
9 | 43631352405713 |
10 | 11214040412415 |
11 | 3633936510835 |
12 | 1311433540193 |
13 | 634630531569 |
14 | 2aaa9624d611 |
15 | 146a82595ab0 |
hex | a32f8e530ff |
11214040412415 has 16 divisors (see below), whose sum is σ = 18886804905600. Its totient is φ = 5666041471392.
The previous prime is 11214040412411. The next prime is 11214040412429. The reversal of 11214040412415 is 51421404041211.
It is not a de Polignac number, because 11214040412415 - 22 = 11214040412411 is a prime.
It is a super-2 number, since 2×112140404124152 (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 (11214040412411) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19673754825 + ... + 19673755394.
It is an arithmetic number, because the mean of its divisors is an integer number (1180425306600).
Almost surely, 211214040412415 is an apocalyptic number.
11214040412415 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11214040412415 is a deficient number, since it is larger than the sum of its proper divisors (7672764493185).
11214040412415 is a wasteful number, since it uses less digits than its factorization.
11214040412415 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39347510246.
The product of its (nonzero) digits is 5120, while the sum is 30.
Adding to 11214040412415 its reverse (51421404041211), we get a palindrome (62635444453626).
The spelling of 11214040412415 in words is "eleven trillion, two hundred fourteen billion, forty million, four hundred twelve thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •