Base | Representation |
---|---|
bin | 1011110101111100001000… |
… | …0001110000000110001111 |
3 | 1201002211020212022012100011 |
4 | 2331133002001300012033 |
5 | 3201320111041110411 |
6 | 43405523025214051 |
7 | 2512520660153335 |
oct | 275370201600617 |
9 | 51084225265304 |
10 | 13021301113231 |
11 | 4170337017404 |
12 | 1563747491327 |
13 | 735b98a9a928 |
14 | 33033d03bb55 |
15 | 178aa9762c21 |
hex | bd7c207018f |
13021301113231 has 4 divisors (see below), whose sum is σ = 13021336444752. Its totient is φ = 13021265781712.
The previous prime is 13021301113217. The next prime is 13021301113237. The reversal of 13021301113231 is 13231110312031.
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 13021301113231 - 29 = 13021301112719 is a prime.
It is a super-2 number, since 2×130213011132312 (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 (13021301113237) 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, 17107051 + ... + 17851996.
It is an arithmetic number, because the mean of its divisors is an integer number (3255334111188).
Almost surely, 213021301113231 is an apocalyptic number.
13021301113231 is a deficient number, since it is larger than the sum of its proper divisors (35331521).
13021301113231 is an equidigital number, since it uses as much as digits as its factorization.
13021301113231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35331520.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 13021301113231 its reverse (13231110312031), we get a palindrome (26252411425262).
The spelling of 13021301113231 in words is "thirteen trillion, twenty-one billion, three hundred one million, one hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •