Base | Representation |
---|---|
bin | 1010010001111111001000… |
… | …1011110100011010010111 |
3 | 1111000122220201010010111220 |
4 | 2210133302023310122113 |
5 | 2440201320231442221 |
6 | 40013013024301423 |
7 | 2244460453546530 |
oct | 244376213643227 |
9 | 44018821103456 |
10 | 11304122140311 |
11 | 3669062283240 |
12 | 1326993771873 |
13 | 63cc8826a530 |
14 | 2b119dd43687 |
15 | 1490a5bb80c6 |
hex | a47f22f4697 |
11304122140311 has 64 divisors (see below), whose sum is σ = 20783689522176. Its totient is φ = 5274056448000.
The previous prime is 11304122140273. The next prime is 11304122140343.
11304122140311 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 11304122140311 - 211 = 11304122138263 is a prime.
It is a super-3 number, since 3×113041221403113 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11304122140361) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 50757490 + ... + 50979711.
It is an arithmetic number, because the mean of its divisors is an integer number (324745148784).
Almost surely, 211304122140311 is an apocalyptic number.
11304122140311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11304122140311 is a deficient number, since it is larger than the sum of its proper divisors (9479567381865).
11304122140311 is a wasteful number, since it uses less digits than its factorization.
11304122140311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 101737272.
The product of its (nonzero) digits is 576, while the sum is 24.
It can be divided in two parts, 1130412 and 2140311, that added together give a palindrome (3270723).
The spelling of 11304122140311 in words is "eleven trillion, three hundred four billion, one hundred twenty-two million, one hundred forty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •