Base | Representation |
---|---|
bin | 11000110100100010… |
… | …10001011011110001 |
3 | 1021101200112111221111 |
4 | 30122101101123301 |
5 | 204242330343421 |
6 | 10042142353321 |
7 | 651136022461 |
oct | 143221213361 |
9 | 37350474844 |
10 | 13325637361 |
11 | 5718a7a643 |
12 | 26ba88b841 |
13 | 13449a7b2a |
14 | 905ad3ba1 |
15 | 52ed26ee1 |
hex | 31a4516f1 |
13325637361 has 4 divisors (see below), whose sum is σ = 13347376372. Its totient is φ = 13303898352.
The previous prime is 13325637359. The next prime is 13325637389. The reversal of 13325637361 is 16373652331.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 16373652331 = 16319 ⋅1003349.
It can be written as a sum of positive squares in 2 ways, for example, as 2333373025 + 10992264336 = 48305^2 + 104844^2 .
It is a cyclic number.
It is not a de Polignac number, because 13325637361 - 21 = 13325637359 is a prime.
It is a super-2 number, since 2×133256373612 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13325637161) 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, 10868586 + ... + 10869811.
It is an arithmetic number, because the mean of its divisors is an integer number (3336844093).
Almost surely, 213325637361 is an apocalyptic number.
It is an amenable number.
13325637361 is a deficient number, since it is larger than the sum of its proper divisors (21739011).
13325637361 is an equidigital number, since it uses as much as digits as its factorization.
13325637361 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21739010.
The product of its digits is 204120, while the sum is 40.
The spelling of 13325637361 in words is "thirteen billion, three hundred twenty-five million, six hundred thirty-seven thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •