Base | Representation |
---|---|
bin | 1001101010001100101110… |
… | …10101001101110110110111 |
3 | 2210012122010102021222120011 |
4 | 10311012113111031312313 |
5 | 10241003334430400434 |
6 | 113102014533121051 |
7 | 4321423360451515 |
oct | 465062725156667 |
9 | 83178112258504 |
10 | 21241152200119 |
11 | 684a35a730175 |
12 | 2470816a89187 |
13 | bb105557a5c7 |
14 | 536111d9d4b5 |
15 | 26c7e77a0e64 |
hex | 13519754ddb7 |
21241152200119 has 4 divisors (see below), whose sum is σ = 21242539891144. Its totient is φ = 21239764509096.
The previous prime is 21241152200101. The next prime is 21241152200123. The reversal of 21241152200119 is 91100225114212.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 21241152200119 - 217 = 21241152069047 is a prime.
It is a super-2 number, since 2×212411522001192 (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 (21241152204119) 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, 693822552 + ... + 693853165.
It is an arithmetic number, because the mean of its divisors is an integer number (5310634972786).
Almost surely, 221241152200119 is an apocalyptic number.
21241152200119 is a deficient number, since it is larger than the sum of its proper divisors (1387691025).
21241152200119 is a wasteful number, since it uses less digits than its factorization.
21241152200119 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1387691024.
The product of its (nonzero) digits is 2880, while the sum is 31.
It can be divided in two parts, 2124115 and 2200119, that added together give a palindrome (4324234).
The spelling of 21241152200119 in words is "twenty-one trillion, two hundred forty-one billion, one hundred fifty-two million, two hundred thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •