Base | Representation |
---|---|
bin | 101010001001101… |
… | …0011000111000001 |
3 | 10122120100011210211 |
4 | 1110103103013001 |
5 | 10344033021103 |
6 | 352202154121 |
7 | 50022510154 |
oct | 12423230701 |
9 | 3576304724 |
10 | 1414345153 |
11 | 6663a74a1 |
12 | 3357b2941 |
13 | 197032030 |
14 | d5ba7c9b |
15 | 8427a36d |
hex | 544d31c1 |
1414345153 has 8 divisors (see below), whose sum is σ = 1537377408. Its totient is φ = 1293346704.
The previous prime is 1414345151. The next prime is 1414345157. The reversal of 1414345153 is 3515434141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1414345153 - 21 = 1414345151 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1414345151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 507001 + ... + 509782.
It is an arithmetic number, because the mean of its divisors is an integer number (192172176).
Almost surely, 21414345153 is an apocalyptic number.
1414345153 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1414345153 is a deficient number, since it is larger than the sum of its proper divisors (123032255).
1414345153 is a wasteful number, since it uses less digits than its factorization.
1414345153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1016903.
The product of its digits is 14400, while the sum is 31.
The square root of 1414345153 is about 37607.7804848943. The cubic root of 1414345153 is about 1122.4968617462.
Adding to 1414345153 its reverse (3515434141), we get a palindrome (4929779294).
The spelling of 1414345153 in words is "one billion, four hundred fourteen million, three hundred forty-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •