Base | Representation |
---|---|
bin | 11000001111001001… |
… | …11000110001100101 |
3 | 1020120211101201000022 |
4 | 30013210320301211 |
5 | 203122033342013 |
6 | 5551100324525 |
7 | 640310164301 |
oct | 140744706145 |
9 | 36524351008 |
10 | 13012012133 |
11 | 5577a3a33a |
12 | 2631843745 |
13 | 12c4a19383 |
14 | 8b61b4d01 |
15 | 512526008 |
hex | 307938c65 |
13012012133 has 4 divisors (see below), whose sum is σ = 13058318508. Its totient is φ = 12965705760.
The previous prime is 13012012099. The next prime is 13012012141. The reversal of 13012012133 is 33121021031.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 33121021031 = 7 ⋅4731574433.
It can be written as a sum of positive squares in 2 ways, for example, as 3136224004 + 9875788129 = 56002^2 + 99377^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13012012133 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13012012163) 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, 23152766 + ... + 23153327.
It is an arithmetic number, because the mean of its divisors is an integer number (3264579627).
Almost surely, 213012012133 is an apocalyptic number.
It is an amenable number.
13012012133 is a deficient number, since it is larger than the sum of its proper divisors (46306375).
13012012133 is an equidigital number, since it uses as much as digits as its factorization.
13012012133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46306374.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 13012012133 its reverse (33121021031), we get a palindrome (46133033164).
The spelling of 13012012133 in words is "thirteen billion, twelve million, twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •