Base | Representation |
---|---|
bin | 1001101001011010001111… |
… | …00100111100010000111111 |
3 | 2210010001011020002002001111 |
4 | 10310231013210330100333 |
5 | 10240032330322410221 |
6 | 113041333013422451 |
7 | 4316443536452263 |
oct | 464550744742077 |
9 | 83101136062044 |
10 | 21214044341311 |
11 | 6839909a88678 |
12 | 246751063aa27 |
13 | bab625434173 |
14 | 534a9dac20a3 |
15 | 26bc5ca12be1 |
hex | 134b4793c43f |
21214044341311 has 8 divisors (see below), whose sum is σ = 21437232894000. Its totient is φ = 20991783808320.
The previous prime is 21214044341257. The next prime is 21214044341327. The reversal of 21214044341311 is 11314344041212.
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 21214044341311 - 217 = 21214044210239 is a prime.
It is a super-2 number, since 2×212140443413112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21214044341911) 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, 231958966 + ... + 232050403.
It is an arithmetic number, because the mean of its divisors is an integer number (2679654111750).
Almost surely, 221214044341311 is an apocalyptic number.
21214044341311 is a deficient number, since it is larger than the sum of its proper divisors (223188552689).
21214044341311 is a wasteful number, since it uses less digits than its factorization.
21214044341311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 464009849.
The product of its (nonzero) digits is 9216, while the sum is 31.
Adding to 21214044341311 its reverse (11314344041212), we get a palindrome (32528388382523).
The spelling of 21214044341311 in words is "twenty-one trillion, two hundred fourteen billion, forty-four million, three hundred forty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •