Base | Representation |
---|---|
bin | 11000101000010011… |
… | …01111101111000111 |
3 | 1021010112102001100221 |
4 | 30110021233233013 |
5 | 204040042013111 |
6 | 10024034445211 |
7 | 645451440262 |
oct | 142411575707 |
9 | 37115361327 |
10 | 13223001031 |
11 | 5676048429 |
12 | 2690433807 |
13 | 1329650386 |
14 | 8d6217cd9 |
15 | 525d01371 |
hex | 31426fbc7 |
13223001031 has 4 divisors (see below), whose sum is σ = 13242649552. Its totient is φ = 13203352512.
The previous prime is 13223001023. The next prime is 13223001041. The reversal of 13223001031 is 13010032231.
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 13223001031 - 23 = 13223001023 is a prime.
It is a super-2 number, since 2×132230010312 (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 = 13223000996 and 13223001014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13223001041) 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, 9823251 + ... + 9824596.
It is an arithmetic number, because the mean of its divisors is an integer number (3310662388).
Almost surely, 213223001031 is an apocalyptic number.
13223001031 is a deficient number, since it is larger than the sum of its proper divisors (19648521).
13223001031 is an equidigital number, since it uses as much as digits as its factorization.
13223001031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19648520.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 13223001031 its reverse (13010032231), we get a palindrome (26233033262).
The spelling of 13223001031 in words is "thirteen billion, two hundred twenty-three million, one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •