Base | Representation |
---|---|
bin | 100111010101111… |
… | …1001101101001001 |
3 | 10102000001121211121 |
4 | 1032223321231021 |
5 | 10200423201101 |
6 | 334554555241 |
7 | 44466634411 |
oct | 11653715511 |
9 | 3360047747 |
10 | 1320131401 |
11 | 6181a8296 |
12 | 30a138b21 |
13 | 180666154 |
14 | c7481641 |
15 | 7ad6a0a1 |
hex | 4eaf9b49 |
1320131401 has 4 divisors (see below), whose sum is σ = 1320233092. Its totient is φ = 1320029712.
The previous prime is 1320131389. The next prime is 1320131443. The reversal of 1320131401 is 1041310231.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 474194176 + 845937225 = 21776^2 + 29085^2 .
It is a cyclic number.
It is not a de Polignac number, because 1320131401 - 213 = 1320123209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1320138401) 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, 27930 + ... + 58483.
It is an arithmetic number, because the mean of its divisors is an integer number (330058273).
Almost surely, 21320131401 is an apocalyptic number.
It is an amenable number.
1320131401 is a deficient number, since it is larger than the sum of its proper divisors (101691).
1320131401 is an equidigital number, since it uses as much as digits as its factorization.
1320131401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 101690.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 1320131401 is about 36333.6125509149. The cubic root of 1320131401 is about 1096.9977087265.
Adding to 1320131401 its reverse (1041310231), we get a palindrome (2361441632).
The spelling of 1320131401 in words is "one billion, three hundred twenty million, one hundred thirty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •