Base | Representation |
---|---|
bin | 1001101100010010110011… |
… | …00011111111111101111111 |
3 | 2210110111220200211221021122 |
4 | 10312021121203333331333 |
5 | 10243143242331111111 |
6 | 113155041130221155 |
7 | 4326552144463556 |
oct | 466113143777577 |
9 | 83414820757248 |
10 | 21313130332031 |
11 | 6877936492aaa |
12 | 24827642847bb |
13 | bb7a867837c5 |
14 | 5397bd5bad9d |
15 | 26e60b8a4cdb |
hex | 1362598fff7f |
21313130332031 has 4 divisors (see below), whose sum is σ = 22566843880992. Its totient is φ = 20059416783072.
The previous prime is 21313130332007. The next prime is 21313130332049. The reversal of 21313130332031 is 13023303131312.
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 21313130332031 - 210 = 21313130331007 is a prime.
It is a super-2 number, since 2×213131303320312 (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 (21313130322031) 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, 626856774455 + ... + 626856774488.
It is an arithmetic number, because the mean of its divisors is an integer number (5641710970248).
Almost surely, 221313130332031 is an apocalyptic number.
21313130332031 is a deficient number, since it is larger than the sum of its proper divisors (1253713548961).
21313130332031 is a wasteful number, since it uses less digits than its factorization.
21313130332031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1253713548960.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 21313130332031 its reverse (13023303131312), we get a palindrome (34336433463343).
The spelling of 21313130332031 in words is "twenty-one trillion, three hundred thirteen billion, one hundred thirty million, three hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •