Base | Representation |
---|---|
bin | 111100110100010… |
… | …010100001110101 |
3 | 2122002221122211000 |
4 | 330310102201311 |
5 | 4042201342331 |
6 | 245125233513 |
7 | 34166515116 |
oct | 7464224165 |
9 | 2562848730 |
10 | 1020340341 |
11 | 483a56889 |
12 | 245862899 |
13 | 13350c4a7 |
14 | 9972420d |
15 | 5e89d0e6 |
hex | 3cd12875 |
1020340341 has 16 divisors (see below), whose sum is σ = 1512526720. Its totient is φ = 679816800.
The previous prime is 1020340327. The next prime is 1020340367. The reversal of 1020340341 is 1430430201.
1020340341 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1020340341 - 27 = 1020340213 is a prime.
It is a super-2 number, since 2×10203403412 = 2082188822943992562, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020340301) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 38136 + ... + 59118.
It is an arithmetic number, because the mean of its divisors is an integer number (94532920).
Almost surely, 21020340341 is an apocalyptic number.
It is an amenable number.
1020340341 is a deficient number, since it is larger than the sum of its proper divisors (492186379).
1020340341 is a wasteful number, since it uses less digits than its factorization.
1020340341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22793 (or 22787 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
The square root of 1020340341 is about 31942.7666459873. The cubic root of 1020340341 is about 1006.7346562537.
Adding to 1020340341 its reverse (1430430201), we get a palindrome (2450770542).
The spelling of 1020340341 in words is "one billion, twenty million, three hundred forty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •