Base | Representation |
---|---|
bin | 10011000111110011001… |
… | …000011100111000010101 |
3 | 11122121202222210212102001 |
4 | 103013303020130320111 |
5 | 133012130242313323 |
6 | 2443355153315301 |
7 | 163636144410541 |
oct | 23076310347025 |
9 | 4577688725361 |
10 | 1314044104213 |
11 | 467312704595 |
12 | 192806865b31 |
13 | 96bb58a8c89 |
14 | 47858862a21 |
15 | 242abd6b3ad |
hex | 131f321ce15 |
1314044104213 has 4 divisors (see below), whose sum is σ = 1316403250380. Its totient is φ = 1311684958048.
The previous prime is 1314044104207. The next prime is 1314044104229. The reversal of 1314044104213 is 3124014404131.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 129414306564 + 1184629797649 = 359742^2 + 1088407^2 .
It is a cyclic number.
It is not a de Polignac number, because 1314044104213 - 217 = 1314043973141 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1314044104313) 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, 1179572248 + ... + 1179573361.
It is an arithmetic number, because the mean of its divisors is an integer number (329100812595).
Almost surely, 21314044104213 is an apocalyptic number.
It is an amenable number.
1314044104213 is a deficient number, since it is larger than the sum of its proper divisors (2359146167).
1314044104213 is an equidigital number, since it uses as much as digits as its factorization.
1314044104213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2359146166.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 1314044104213 its reverse (3124014404131), we get a palindrome (4438058508344).
The spelling of 1314044104213 in words is "one trillion, three hundred fourteen billion, forty-four million, one hundred four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •