Base | Representation |
---|---|
bin | 1001101100010010111111… |
… | …01000010101011111110001 |
3 | 2210110112011210101220200212 |
4 | 10312021133220111133301 |
5 | 10243143444411211311 |
6 | 113155055204153505 |
7 | 4326554521663661 |
oct | 466113750253761 |
9 | 83415153356625 |
10 | 21313232132081 |
11 | 68779889a397a |
12 | 2482792398895 |
13 | bb7aa18a7716 |
14 | 5397ccd1a1a1 |
15 | 26e6157b2c8b |
hex | 13625fa157f1 |
21313232132081 has 2 divisors, whose sum is σ = 21313232132082. Its totient is φ = 21313232132080.
The previous prime is 21313232132069. The next prime is 21313232132107. The reversal of 21313232132081 is 18023123231312.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20488070640625 + 825161491456 = 4526375^2 + 908384^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21313232132081 is a prime.
It is a super-2 number, since 2×213132321320812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21313232132051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10656616066040 + 10656616066041.
It is an arithmetic number, because the mean of its divisors is an integer number (10656616066041).
Almost surely, 221313232132081 is an apocalyptic number.
It is an amenable number.
21313232132081 is a deficient number, since it is larger than the sum of its proper divisors (1).
21313232132081 is an equidigital number, since it uses as much as digits as its factorization.
21313232132081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 32.
Adding to 21313232132081 its reverse (18023123231312), we get a palindrome (39336355363393).
The spelling of 21313232132081 in words is "twenty-one trillion, three hundred thirteen billion, two hundred thirty-two million, one hundred thirty-two thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •