Base | Representation |
---|---|
bin | 1001100111000000010100… |
… | …11100010110100111010111 |
3 | 2202211010212121002010012102 |
4 | 10303200022130112213113 |
5 | 10232204114030114033 |
6 | 112535345425112315 |
7 | 4310460100633136 |
oct | 463401234264727 |
9 | 82733777063172 |
10 | 21131414301143 |
11 | 6807867529483 |
12 | 24534aba8869b |
13 | ba38b746c083 |
14 | 530aa192591d |
15 | 269a236ccde8 |
hex | 13380a7169d7 |
21131414301143 has 4 divisors (see below), whose sum is σ = 21149009151888. Its totient is φ = 21113819450400.
The previous prime is 21131414301131. The next prime is 21131414301163. The reversal of 21131414301143 is 34110341413112.
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 21131414301143 - 212 = 21131414297047 is a prime.
It is a super-2 number, since 2×211314143011432 (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 (21131414301163) 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, 8797423571 + ... + 8797425972.
It is an arithmetic number, because the mean of its divisors is an integer number (5287252287972).
Almost surely, 221131414301143 is an apocalyptic number.
21131414301143 is a deficient number, since it is larger than the sum of its proper divisors (17594850745).
21131414301143 is a wasteful number, since it uses less digits than its factorization.
21131414301143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17594850744.
The product of its (nonzero) digits is 3456, while the sum is 29.
Adding to 21131414301143 its reverse (34110341413112), we get a palindrome (55241755714255).
The spelling of 21131414301143 in words is "twenty-one trillion, one hundred thirty-one billion, four hundred fourteen million, three hundred one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •