Base | Representation |
---|---|
bin | 1001101100010010100011… |
… | …11111001001011110011011 |
3 | 2210110111120211200112121220 |
4 | 10312021101333021132123 |
5 | 10243143012311344011 |
6 | 113155020350103123 |
7 | 4326546042236163 |
oct | 466112177113633 |
9 | 83414524615556 |
10 | 21313003231131 |
11 | 6877880771237 |
12 | 24827297aaaa3 |
13 | bb7a66341781 |
14 | 5397aa7735a3 |
15 | 26e60064a506 |
hex | 136251fc979b |
21313003231131 has 16 divisors (see below), whose sum is σ = 29660947616256. Its totient is φ = 13587200231616.
The previous prime is 21313003231111. The next prime is 21313003231151. The reversal of 21313003231131 is 13113230031312.
It is an interprime number because it is at equal distance from previous prime (21313003231111) and next prime (21313003231151).
It is not a de Polignac number, because 21313003231131 - 223 = 21312994842523 is a prime.
It is a super-2 number, since 2×213130032311312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (21313003231111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 41794495 + ... + 42301368.
It is an arithmetic number, because the mean of its divisors is an integer number (1853809226016).
Almost surely, 221313003231131 is an apocalyptic number.
21313003231131 is a deficient number, since it is larger than the sum of its proper divisors (8347944385125).
21313003231131 is a wasteful number, since it uses less digits than its factorization.
21313003231131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84099562.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 21313003231131 its reverse (13113230031312), we get a palindrome (34426233262443).
The spelling of 21313003231131 in words is "twenty-one trillion, three hundred thirteen billion, three million, two hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •