Base | Representation |
---|---|
bin | 11000001111010001… |
… | …01111010101001111 |
3 | 1020120220022000022221 |
4 | 30013220233111033 |
5 | 203122313201111 |
6 | 5551134120211 |
7 | 640321601512 |
oct | 140750572517 |
9 | 36526260287 |
10 | 13013022031 |
11 | 557856a069 |
12 | 2632050067 |
13 | 12c4cb0c49 |
14 | 8b6398d79 |
15 | 512675371 |
hex | 307a2f54f |
13013022031 has 4 divisors (see below), whose sum is σ = 13128181632. Its totient is φ = 12897862432.
The previous prime is 13013021981. The next prime is 13013022067. The reversal of 13013022031 is 13022031031.
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 13013022031 - 29 = 13013021519 is a prime.
It is a super-2 number, since 2×130130220312 (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 = 13013021996 and 13013022014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13013032031) 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, 57579631 + ... + 57579856.
It is an arithmetic number, because the mean of its divisors is an integer number (3282045408).
Almost surely, 213013022031 is an apocalyptic number.
13013022031 is a deficient number, since it is larger than the sum of its proper divisors (115159601).
13013022031 is a wasteful number, since it uses less digits than its factorization.
13013022031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115159600.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 13013022031 its reverse (13022031031), we get a palindrome (26035053062).
The spelling of 13013022031 in words is "thirteen billion, thirteen million, twenty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •