Base | Representation |
---|---|
bin | 110000111010000… |
… | …0010011011100001 |
3 | 11020100220000212111 |
4 | 1201310002123201 |
5 | 11330101001033 |
6 | 430500555321 |
7 | 55444352041 |
oct | 14164023341 |
9 | 4210800774 |
10 | 1641031393 |
11 | 7723571a1 |
12 | 3996b2b41 |
13 | 201ca0bc1 |
14 | 117d35721 |
15 | 991067cd |
hex | 61d026e1 |
1641031393 has 4 divisors (see below), whose sum is σ = 1712380608. Its totient is φ = 1569682180.
The previous prime is 1641031339. The next prime is 1641031409. The reversal of 1641031393 is 3931301461.
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: 3931301461 = 839 ⋅4685699.
It is a cyclic number.
It is not a de Polignac number, because 1641031393 - 217 = 1640900321 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1641031303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35674573 + ... + 35674618.
It is an arithmetic number, because the mean of its divisors is an integer number (428095152).
Almost surely, 21641031393 is an apocalyptic number.
It is an amenable number.
1641031393 is a deficient number, since it is larger than the sum of its proper divisors (71349215).
1641031393 is an equidigital number, since it uses as much as digits as its factorization.
1641031393 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71349214.
The product of its (nonzero) digits is 5832, while the sum is 31.
The square root of 1641031393 is about 40509.6456785295. The cubic root of 1641031393 is about 1179.5208705472.
The spelling of 1641031393 in words is "one billion, six hundred forty-one million, thirty-one thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •