Base | Representation |
---|---|
bin | 100111001011011… |
… | …0110101100100011 |
3 | 10101121200022110022 |
4 | 1032112312230203 |
5 | 10143020122201 |
6 | 334240424055 |
7 | 44402015012 |
oct | 11626665443 |
9 | 3347608408 |
10 | 1314614051 |
11 | 615079aa3 |
12 | 30831802b |
13 | 17c483a4a |
14 | c6846a79 |
15 | 7a62a41b |
hex | 4e5b6b23 |
1314614051 has 8 divisors (see below), whose sum is σ = 1369876320. Its totient is φ = 1260013888.
The previous prime is 1314613997. The next prime is 1314614053. The reversal of 1314614051 is 1504164131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1314614051 - 214 = 1314597667 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 1314614051.
It is not an unprimeable number, because it can be changed into a prime (1314614053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 161471 + ... + 169416.
It is an arithmetic number, because the mean of its divisors is an integer number (171234540).
Almost surely, 21314614051 is an apocalyptic number.
1314614051 is a deficient number, since it is larger than the sum of its proper divisors (55262269).
1314614051 is a wasteful number, since it uses less digits than its factorization.
1314614051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 331053.
The product of its (nonzero) digits is 1440, while the sum is 26.
The square root of 1314614051 is about 36257.6068018837. The cubic root of 1314614051 is about 1095.4673126126.
Adding to 1314614051 its reverse (1504164131), we get a palindrome (2818778182).
The spelling of 1314614051 in words is "one billion, three hundred fourteen million, six hundred fourteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •