Base | Representation |
---|---|
bin | 111100110011011… |
… | …101000011111101 |
3 | 2122002112112101220 |
4 | 330303131003331 |
5 | 4042122340331 |
6 | 245120423553 |
7 | 34164613461 |
oct | 7463350375 |
9 | 2562475356 |
10 | 1020121341 |
11 | 483917298 |
12 | 245777bb9 |
13 | 1334638c5 |
14 | 996a84a1 |
15 | 5e858296 |
hex | 3ccdd0fd |
1020121341 has 8 divisors (see below), whose sum is σ = 1363139904. Its totient is φ = 678591840.
The previous prime is 1020121307. The next prime is 1020121367. The reversal of 1020121341 is 1431210201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1020121341 - 27 = 1020121213 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1020121341.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020121301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 370665 + ... + 373406.
It is an arithmetic number, because the mean of its divisors is an integer number (170392488).
Almost surely, 21020121341 is an apocalyptic number.
It is an amenable number.
1020121341 is a deficient number, since it is larger than the sum of its proper divisors (343018563).
1020121341 is an equidigital number, since it uses as much as digits as its factorization.
1020121341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 744531.
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 1020121341 is about 31939.3384558917. The cubic root of 1020121341 is about 1006.6626245153.
Adding to 1020121341 its reverse (1431210201), we get a palindrome (2451331542).
The spelling of 1020121341 in words is "one billion, twenty million, one hundred twenty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •