Base | Representation |
---|---|
bin | 100111001010010… |
… | …1011110111011011 |
3 | 10101120121102102021 |
4 | 1032110223313123 |
5 | 10142343423103 |
6 | 334220315311 |
7 | 44364126106 |
oct | 11624536733 |
9 | 3346542367 |
10 | 1314045403 |
11 | 614820840 |
12 | 3080a2b37 |
13 | 17c314c78 |
14 | c673973d |
15 | 7a566bbd |
hex | 4e52bddb |
1314045403 has 4 divisors (see below), whose sum is σ = 1433504088. Its totient is φ = 1194586720.
The previous prime is 1314045373. The next prime is 1314045431. The reversal of 1314045403 is 3045404131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1314045403 is a prime.
It is a super-2 number, since 2×13140454032 = 3453430642290864818, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1314045443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 59729326 + ... + 59729347.
It is an arithmetic number, because the mean of its divisors is an integer number (358376022).
Almost surely, 21314045403 is an apocalyptic number.
1314045403 is a deficient number, since it is larger than the sum of its proper divisors (119458685).
1314045403 is a wasteful number, since it uses less digits than its factorization.
1314045403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119458684.
The product of its (nonzero) digits is 2880, while the sum is 25.
The square root of 1314045403 is about 36249.7641785433. The cubic root of 1314045403 is about 1095.3093384563.
Adding to 1314045403 its reverse (3045404131), we get a palindrome (4359449534).
The spelling of 1314045403 in words is "one billion, three hundred fourteen million, forty-five thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •