Base | Representation |
---|---|
bin | 11010101010011111… |
… | …10101001000101011 |
3 | 1100221122102012011100 |
4 | 31111033311020223 |
5 | 213304132140201 |
6 | 10324250332443 |
7 | 1014512320206 |
oct | 152517651053 |
9 | 40848365140 |
10 | 14315115051 |
11 | 60865668a6 |
12 | 293612a123 |
13 | 147199c7a3 |
14 | 99b2a293d |
15 | 58bb2a886 |
hex | 3553f522b |
14315115051 has 6 divisors (see below), whose sum is σ = 20677388420. Its totient is φ = 9543410028.
The previous prime is 14315115019. The next prime is 14315115077. The reversal of 14315115051 is 15051151341.
14315115051 is a `hidden beast` number, since 1 + 4 + 3 + 151 + 1 + 505 + 1 = 666.
It is not a de Polignac number, because 14315115051 - 25 = 14315115019 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14315116051) 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 5 ways as a sum of consecutive naturals, for example, 795284161 + ... + 795284178.
Almost surely, 214315115051 is an apocalyptic number.
14315115051 is a deficient number, since it is larger than the sum of its proper divisors (6362273369).
14315115051 is a wasteful number, since it uses less digits than its factorization.
14315115051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1590568345 (or 1590568342 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 27.
Adding to 14315115051 its reverse (15051151341), we get a palindrome (29366266392).
The spelling of 14315115051 in words is "fourteen billion, three hundred fifteen million, one hundred fifteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •