Base | Representation |
---|---|
bin | 1011010111001101… |
… | …0011100000001001 |
3 | 21212120100102100111 |
4 | 2311303103200021 |
5 | 22221313002241 |
6 | 1222354434321 |
7 | 135404431435 |
oct | 26563234011 |
9 | 7776312314 |
10 | 3050125321 |
11 | 1325797331 |
12 | 7115929a1 |
13 | 397bb49a9 |
14 | 20d1339c5 |
15 | 12cb95c81 |
hex | b5cd3809 |
3050125321 has 4 divisors (see below), whose sum is σ = 3121058512. Its totient is φ = 2979192132.
The previous prime is 3050125297. The next prime is 3050125333. The reversal of 3050125321 is 1235210503.
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.
It is a cyclic number.
It is not a de Polignac number, because 3050125321 - 211 = 3050123273 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3050125292 and 3050125301.
It is not an unprimeable number, because it can be changed into a prime (3050129321) 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, 35466531 + ... + 35466616.
It is an arithmetic number, because the mean of its divisors is an integer number (780264628).
Almost surely, 23050125321 is an apocalyptic number.
It is an amenable number.
3050125321 is a deficient number, since it is larger than the sum of its proper divisors (70933191).
3050125321 is an equidigital number, since it uses as much as digits as its factorization.
3050125321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70933190.
The product of its (nonzero) digits is 900, while the sum is 22.
The square root of 3050125321 is about 55227.9396773046. The cubic root of 3050125321 is about 1450.2378240110.
Adding to 3050125321 its reverse (1235210503), we get a palindrome (4285335824).
The spelling of 3050125321 in words is "three billion, fifty million, one hundred twenty-five thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •