Base | Representation |
---|---|
bin | 111100011100101… |
… | …001010110001111 |
3 | 2121200021202202211 |
4 | 330130221112033 |
5 | 4034110023401 |
6 | 244344331251 |
7 | 34063032145 |
oct | 7434512617 |
9 | 2550252684 |
10 | 1014142351 |
11 | 480503182 |
12 | 243773b27 |
13 | 13214c341 |
14 | 9898d595 |
15 | 5e076951 |
hex | 3c72958f |
1014142351 has 4 divisors (see below), whose sum is σ = 1029278872. Its totient is φ = 999005832.
The previous prime is 1014142321. The next prime is 1014142369. The reversal of 1014142351 is 1532414101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1532414101 = 449 ⋅3412949.
It is a cyclic number.
It is not a de Polignac number, because 1014142351 - 213 = 1014134159 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 (1014142321) 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 3 ways as a sum of consecutive naturals, for example, 7568160 + ... + 7568293.
It is an arithmetic number, because the mean of its divisors is an integer number (257319718).
Almost surely, 21014142351 is an apocalyptic number.
1014142351 is a deficient number, since it is larger than the sum of its proper divisors (15136521).
1014142351 is an equidigital number, since it uses as much as digits as its factorization.
1014142351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15136520.
The product of its (nonzero) digits is 480, while the sum is 22.
The square root of 1014142351 is about 31845.6017528324. The cubic root of 1014142351 is about 1004.6920670739.
Adding to 1014142351 its reverse (1532414101), we get a palindrome (2546556452).
The spelling of 1014142351 in words is "one billion, fourteen million, one hundred forty-two thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •