Base | Representation |
---|---|
bin | 11000001111010010… |
… | …00111110010110111 |
3 | 1020120220111002210001 |
4 | 30013221013302313 |
5 | 203122324402411 |
6 | 5551140212131 |
7 | 640322466604 |
oct | 140751076267 |
9 | 36526432701 |
10 | 13013122231 |
11 | 557862837a |
12 | 263209a047 |
13 | 12c5017735 |
14 | 8b63c36ab |
15 | 512694dc1 |
hex | 307a47cb7 |
13013122231 has 4 divisors (see below), whose sum is σ = 13013408200. Its totient is φ = 13012836264.
The previous prime is 13013122223. The next prime is 13013122271. The reversal of 13013122231 is 13222131031.
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 13013122231 - 23 = 13013122223 is a prime.
It is a super-2 number, since 2×130131222312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13013122199 and 13013122208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13013122271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 57816 + ... + 171373.
It is an arithmetic number, because the mean of its divisors is an integer number (3253352050).
Almost surely, 213013122231 is an apocalyptic number.
13013122231 is a deficient number, since it is larger than the sum of its proper divisors (285969).
13013122231 is an equidigital number, since it uses as much as digits as its factorization.
13013122231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 285968.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 13013122231 its reverse (13222131031), we get a palindrome (26235253262).
The spelling of 13013122231 in words is "thirteen billion, thirteen million, one hundred twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •