Base | Representation |
---|---|
bin | 111010001000000… |
… | …1010001100100001 |
3 | 12000221000020101021 |
4 | 1310100022030201 |
5 | 12443300034441 |
6 | 521311405441 |
7 | 66222032215 |
oct | 16420121441 |
9 | 5027006337 |
10 | 1950393121 |
11 | 910a45246 |
12 | 465223881 |
13 | 2510c8b91 |
14 | 147064945 |
15 | b63643d1 |
hex | 7440a321 |
1950393121 has 4 divisors (see below), whose sum is σ = 1950891712. Its totient is φ = 1949894532.
The previous prime is 1950393101. The next prime is 1950393127. The reversal of 1950393121 is 1213930591.
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, and also an emirpimes, since its reverse is a distinct semiprime: 1213930591 = 4093 ⋅296587.
It is a cyclic number.
It is not a de Polignac number, because 1950393121 - 215 = 1950360353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1950393127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 243381 + ... + 251266.
It is an arithmetic number, because the mean of its divisors is an integer number (487722928).
Almost surely, 21950393121 is an apocalyptic number.
It is an amenable number.
1950393121 is a deficient number, since it is larger than the sum of its proper divisors (498591).
1950393121 is an equidigital number, since it uses as much as digits as its factorization.
1950393121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 498590.
The product of its (nonzero) digits is 7290, while the sum is 34.
The square root of 1950393121 is about 44163.2553261192. The cubic root of 1950393121 is about 1249.4169272099.
The spelling of 1950393121 in words is "one billion, nine hundred fifty million, three hundred ninety-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •