Base | Representation |
---|---|
bin | 101001100011100… |
… | …0011101010000001 |
3 | 10121011201202211201 |
4 | 1103013003222001 |
5 | 10323423441123 |
6 | 350205541201 |
7 | 46360566223 |
oct | 12307035201 |
9 | 3534652751 |
10 | 1394358913 |
11 | 656096542 |
12 | 32ab74801 |
13 | 192b54c5c |
14 | d3284413 |
15 | 8262d5ad |
hex | 531c3a81 |
1394358913 has 4 divisors (see below), whose sum is σ = 1395795888. Its totient is φ = 1392921940.
The previous prime is 1394358907. The next prime is 1394358929. The reversal of 1394358913 is 3198534931.
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: 3198534931 = 73 ⋅43815547.
It is a cyclic number.
It is not a de Polignac number, because 1394358913 - 29 = 1394358401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1394358943) 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, 717031 + ... + 718972.
It is an arithmetic number, because the mean of its divisors is an integer number (348948972).
Almost surely, 21394358913 is an apocalyptic number.
It is an amenable number.
1394358913 is a deficient number, since it is larger than the sum of its proper divisors (1436975).
1394358913 is an equidigital number, since it uses as much as digits as its factorization.
1394358913 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1436974.
The product of its digits is 349920, while the sum is 46.
The square root of 1394358913 is about 37341.1155832281. The cubic root of 1394358913 is about 1117.1843905172.
The spelling of 1394358913 in words is "one billion, three hundred ninety-four million, three hundred fifty-eight thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •