Base | Representation |
---|---|
bin | 100111001010011… |
… | …0111100010001101 |
3 | 10101120200211222102 |
4 | 1032110313202031 |
5 | 10142401440242 |
6 | 334221324445 |
7 | 44364415334 |
oct | 11624674215 |
9 | 3346624872 |
10 | 1314093197 |
11 | 61485373a |
12 | 308106725 |
13 | 17c330951 |
14 | c674cd1b |
15 | 7a575e32 |
hex | 4e53788d |
1314093197 has 4 divisors (see below), whose sum is σ = 1314166080. Its totient is φ = 1314020316.
The previous prime is 1314093169. The next prime is 1314093199. The reversal of 1314093197 is 7913904131.
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 a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 1314093197 - 210 = 1314092173 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1314093197.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1314093199) 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, 12638 + ... + 52800.
It is an arithmetic number, because the mean of its divisors is an integer number (328541520).
Almost surely, 21314093197 is an apocalyptic number.
It is an amenable number.
1314093197 is a deficient number, since it is larger than the sum of its proper divisors (72883).
1314093197 is an equidigital number, since it uses as much as digits as its factorization.
1314093197 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72882.
The product of its (nonzero) digits is 20412, while the sum is 38.
The square root of 1314093197 is about 36250.4234044238. The cubic root of 1314093197 is about 1095.3226176981.
The spelling of 1314093197 in words is "one billion, three hundred fourteen million, ninety-three thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •