Base | Representation |
---|---|
bin | 11000101001010001… |
… | …10000010110010001 |
3 | 1021011002201001012220 |
4 | 30110220300112101 |
5 | 204044132130001 |
6 | 10024525011253 |
7 | 645610515015 |
oct | 142450602621 |
9 | 37132631186 |
10 | 13231130001 |
11 | 567a69a891 |
12 | 26930b3b29 |
13 | 132b23840b |
14 | 8d7332545 |
15 | 5268a9c36 |
hex | 314a30591 |
13231130001 has 4 divisors (see below), whose sum is σ = 17641506672. Its totient is φ = 8820753332.
The previous prime is 13231129973. The next prime is 13231130009. The reversal of 13231130001 is 10003113231.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13231130001 - 29 = 13231129489 is a prime.
It is a super-2 number, since 2×132311300012 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13231130009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2205188331 + ... + 2205188336.
It is an arithmetic number, because the mean of its divisors is an integer number (4410376668).
Almost surely, 213231130001 is an apocalyptic number.
It is an amenable number.
13231130001 is a deficient number, since it is larger than the sum of its proper divisors (4410376671).
13231130001 is an equidigital number, since it uses as much as digits as its factorization.
13231130001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4410376670.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 13231130001 its reverse (10003113231), we get a palindrome (23234243232).
The spelling of 13231130001 in words is "thirteen billion, two hundred thirty-one million, one hundred thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •