Base | Representation |
---|---|
bin | 111111001110110010111… |
… | …100011111111011110001 |
3 | 120101101202110000000210102 |
4 | 333032302330133323301 |
5 | 1032142444304441040 |
6 | 13124055215042145 |
7 | 625634312533154 |
oct | 77166274377361 |
9 | 16341673000712 |
10 | 4345214140145 |
11 | 142588211463a |
12 | 5a216b510355 |
13 | 2569a1003908 |
14 | 110449333c9b |
15 | 78067ca6515 |
hex | 3f3b2f1fef1 |
4345214140145 has 8 divisors (see below), whose sum is σ = 5215299224256. Its totient is φ = 3475476474736.
The previous prime is 4345214140117. The next prime is 4345214140181. The reversal of 4345214140145 is 5410414125434.
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 4345214140145 - 230 = 4344140398321 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4345214140099 and 4345214140108.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 86827157 + ... + 86877186.
It is an arithmetic number, because the mean of its divisors is an integer number (651912403032).
Almost surely, 24345214140145 is an apocalyptic number.
It is an amenable number.
4345214140145 is a deficient number, since it is larger than the sum of its proper divisors (870085084111).
4345214140145 is a wasteful number, since it uses less digits than its factorization.
4345214140145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173709351.
The product of its (nonzero) digits is 153600, while the sum is 38.
Adding to 4345214140145 its reverse (5410414125434), we get a palindrome (9755628265579).
The spelling of 4345214140145 in words is "four trillion, three hundred forty-five billion, two hundred fourteen million, one hundred forty thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •