Base | Representation |
---|---|
bin | 11000101001001000… |
… | …11100110010101001 |
3 | 1021011000120200221221 |
4 | 30110210130302221 |
5 | 204043340020241 |
6 | 10024444502041 |
7 | 645565104265 |
oct | 142444346251 |
9 | 37130520857 |
10 | 13230001321 |
11 | 5679a99899 |
12 | 269284a921 |
13 | 132ac31764 |
14 | 8d711b0a5 |
15 | 5267355d1 |
hex | 31491cca9 |
13230001321 has 4 divisors (see below), whose sum is σ = 13926317200. Its totient is φ = 12533685444.
The previous prime is 13230001277. The next prime is 13230001339. The reversal of 13230001321 is 12310003231.
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: 12310003231 = 10957 ⋅1123483.
It is a cyclic number.
It is not a de Polignac number, because 13230001321 - 29 = 13230000809 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13230001295 and 13230001304.
It is not an unprimeable number, because it can be changed into a prime (13230001121) 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, 348157911 + ... + 348157948.
It is an arithmetic number, because the mean of its divisors is an integer number (3481579300).
Almost surely, 213230001321 is an apocalyptic number.
It is an amenable number.
13230001321 is a deficient number, since it is larger than the sum of its proper divisors (696315879).
13230001321 is an equidigital number, since it uses as much as digits as its factorization.
13230001321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 696315878.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 13230001321 its reverse (12310003231), we get a palindrome (25540004552).
The spelling of 13230001321 in words is "thirteen billion, two hundred thirty million, one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •