Base | Representation |
---|---|
bin | 11000110100001001… |
… | …01010001101111001 |
3 | 1021101110022112110201 |
4 | 30122010222031321 |
5 | 204241004043001 |
6 | 10041543442201 |
7 | 651065642110 |
oct | 143204521571 |
9 | 37343275421 |
10 | 13322331001 |
11 | 5717121511 |
12 | 26b9756361 |
13 | 13440babc5 |
14 | 9054b2c77 |
15 | 52e8c2501 |
hex | 31a12a379 |
13322331001 has 4 divisors (see below), whose sum is σ = 15225521152. Its totient is φ = 11419140852.
The previous prime is 13322330977. The next prime is 13322331007. The reversal of 13322331001 is 10013322331.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 10013322331 = 13553 ⋅738827.
It is a de Polignac number, because none of the positive numbers 2k-13322331001 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13322331001.
It is not an unprimeable number, because it can be changed into a prime (13322331007) 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, 951595065 + ... + 951595078.
It is an arithmetic number, because the mean of its divisors is an integer number (3806380288).
Almost surely, 213322331001 is an apocalyptic number.
It is an amenable number.
13322331001 is a deficient number, since it is larger than the sum of its proper divisors (1903190151).
13322331001 is an equidigital number, since it uses as much as digits as its factorization.
13322331001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1903190150.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 13322331001 its reverse (10013322331), we get a palindrome (23335653332).
The spelling of 13322331001 in words is "thirteen billion, three hundred twenty-two million, three hundred thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •