Base | Representation |
---|---|
bin | 1001101110000100110010… |
… | …11110110000011011011111 |
3 | 2210200100212222001002001020 |
4 | 10313002121132300123133 |
5 | 10300144113023213011 |
6 | 113243122131415223 |
7 | 4334146610232105 |
oct | 467023136603337 |
9 | 83610788032036 |
10 | 21374332241631 |
11 | 68a0892360586 |
12 | 24925a4754513 |
13 | bc078b2233b5 |
14 | 53c747939c75 |
15 | 270ede8be006 |
hex | 1370997b06df |
21374332241631 has 4 divisors (see below), whose sum is σ = 28499109655512. Its totient is φ = 14249554827752.
The previous prime is 21374332241629. The next prime is 21374332241653. The reversal of 21374332241631 is 13614223347312.
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 21374332241631 - 21 = 21374332241629 is a prime.
It is a super-2 number, since 2×213743322416312 (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 (21374332241621) 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, 3562388706936 + ... + 3562388706941.
It is an arithmetic number, because the mean of its divisors is an integer number (7124777413878).
Almost surely, 221374332241631 is an apocalyptic number.
21374332241631 is a deficient number, since it is larger than the sum of its proper divisors (7124777413881).
21374332241631 is an equidigital number, since it uses as much as digits as its factorization.
21374332241631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7124777413880.
The product of its digits is 435456, while the sum is 42.
Adding to 21374332241631 its reverse (13614223347312), we get a palindrome (34988555588943).
The spelling of 21374332241631 in words is "twenty-one trillion, three hundred seventy-four billion, three hundred thirty-two million, two hundred forty-one thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •