Base | Representation |
---|---|
bin | 100111001010011… |
… | …1110010101011011 |
3 | 10101120202021012001 |
4 | 1032110332111123 |
5 | 10142403333201 |
6 | 334222101431 |
7 | 44364562465 |
oct | 11624762533 |
9 | 3346667161 |
10 | 1314121051 |
11 | 614872661 |
12 | 30811a877 |
13 | 17c340529 |
14 | c6759135 |
15 | 7a57e301 |
hex | 4e53e55b |
1314121051 has 4 divisors (see below), whose sum is σ = 1359435600. Its totient is φ = 1268806504.
The previous prime is 1314121033. The next prime is 1314121069. The reversal of 1314121051 is 1501214131.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1501214131 = 71 ⋅21143861.
It is an interprime number because it is at equal distance from previous prime (1314121033) and next prime (1314121069).
It is a cyclic number.
It is not a de Polignac number, because 1314121051 - 27 = 1314120923 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1314121091) 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, 22657231 + ... + 22657288.
It is an arithmetic number, because the mean of its divisors is an integer number (339858900).
Almost surely, 21314121051 is an apocalyptic number.
1314121051 is a deficient number, since it is larger than the sum of its proper divisors (45314549).
1314121051 is an equidigital number, since it uses as much as digits as its factorization.
1314121051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45314548.
The product of its (nonzero) digits is 120, while the sum is 19.
The square root of 1314121051 is about 36250.8075910041. The cubic root of 1314121051 is about 1095.3303565964.
Adding to 1314121051 its reverse (1501214131), we get a palindrome (2815335182).
The spelling of 1314121051 in words is "one billion, three hundred fourteen million, one hundred twenty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •