Base | Representation |
---|---|
bin | 11101101100011111100… |
… | …11111011010101001001 |
3 | 10121112121212002112212121 |
4 | 32312033303323111021 |
5 | 113204103410102101 |
6 | 2100421210411241 |
7 | 133500323634316 |
oct | 16661763732511 |
9 | 3545555075777 |
10 | 1020320003401 |
11 | 363796051236 |
12 | 1458b3130b21 |
13 | 752a60560aa |
14 | 3755302bd0d |
15 | 1b81a6430a1 |
hex | ed8fcfb549 |
1020320003401 has 4 divisors (see below), whose sum is σ = 1020864757012. Its totient is φ = 1019775249792.
The previous prime is 1020320003347. The next prime is 1020320003411. The reversal of 1020320003401 is 1043000230201.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 473755513401 + 546564490000 = 688299^2 + 739300^2 .
It is a cyclic number.
It is not a de Polignac number, because 1020320003401 - 27 = 1020320003273 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1020320003411) 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, 272373996 + ... + 272377741.
It is an arithmetic number, because the mean of its divisors is an integer number (255216189253).
Almost surely, 21020320003401 is an apocalyptic number.
It is an amenable number.
1020320003401 is a deficient number, since it is larger than the sum of its proper divisors (544753611).
1020320003401 is an equidigital number, since it uses as much as digits as its factorization.
1020320003401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 544753610.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 1020320003401 its reverse (1043000230201), we get a palindrome (2063320233602).
The spelling of 1020320003401 in words is "one trillion, twenty billion, three hundred twenty million, three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •